Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices
The authors consider the solution of the generalized eigenvalue problem \(Ax = \lambda Mx\), where \(A\) and \(M\) are real symmetric matrices and \(M\) is positive definite. They compare numerically three algorithms: Reduction to a standard eigenvalue problem, multisectioning with Sturm sequences, and the Lanczos method. In the first algorithm the use of one vector processor for an effective Givens transformation is discussed. Parallel implementations for the following two algorithms are considered. All the tests are performed on matrices which belong to the Harwell- Boeing set of test matrices.
- A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Banded Eigenvalue Solvers on Vector Machines
- How to Implement the Spectral Transformation
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Solution of Sparse Indefinite Systems of Linear Equations
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- Tridiagonalization of a symmetric band matrix
- Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
- An algorithm for the symmetric generalized eigenvalue problem
- An algorithm for the generalized symmetric tridiagonal eigenvalue problem
- Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices
- A parallel GMRES version for general sparse matrices
- Linear parameterized inverse eigenvalue problem of bisymmetric matrices
- scientific article; zbMATH DE number 434535 (Why is no real title available?)
- scientific article; zbMATH DE number 4201480 (Why is no real title available?)
- Solving eigenvalue problems by implicit decomposition
- scientific article; zbMATH DE number 6531153 (Why is no real title available?)
- How to Implement the Spectral Transformation
- Solution of large, dense symmetric generalized eigenvalue problems using secondary storage
- Solving dense generalized eigenproblems on multi-threaded architectures
- scientific article; zbMATH DE number 1526541 (Why is no real title available?)
- scientific article; zbMATH DE number 822157 (Why is no real title available?)
- scientific article; zbMATH DE number 7468269 (Why is no real title available?)
- A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations
- Automatic code selection for the dense symmetric generalized eigenvalue problem using ATMathCoreLib
- The Lanczos algorithm for the generalized symmetric eigenproblem on shared-memory architectures
- An acceleration method for computing the generalized eigenvalue problem on a parallel computer
- A parallel algorithm for the generalized symmetric eigenvalue problem on a hybrid multiprocessor
This page was built for publication: Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685967)
