An algorithm for the generalized symmetric tridiagonal eigenvalue problem
From MaRDI portal
Publication:1344110
DOI10.1007/BF02142694zbMath0821.65018MaRDI QIDQ1344110
Zhonggang Zeng, Kuiyuan Li, Tien-Yien Li
Publication date: 27 September 1995
Published in: Numerical Algorithms (Search for Journal in Brave)
algorithmnumerical resultscharacteristic polynomialgeneralized eigenvalue problemsymmetric tridiagonal matricesthree-term recurrencesLaguerre's iteration
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items (4)
Simultaneous band reduction of two symmetric matrices ⋮ Quadrature rules from a \(R_{II}\) type recurrence relation and associated quadrature rules on the unit circle ⋮ Preconditioners for Saddle Point Systems with Trace Constraints Coupling 2D and 1D Domains ⋮ Decompositions and coalescing eigenvalues of symmetric definite pencils depending on parameters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A scalable eigenvalue solver for symmetric tridiagonal matrices
- Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A homotopy algorithm for a symmetric generalized eigenproblem
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- Families of High Order Accurate Discretizations of Some Elliptic Problems
- The Laguerre Iteration in Solving the Symmetric Tridiagonal Eigenproblem, Revisited
- An Algorithm for Symmetric Tridiagonal Eigenproblems: Divide and Conquer with Homotopy Continuation
- Symmetric matrix methods for Schrodinger eigenvectors
- An Algorithm for the Banded Symmetric Generalized Matrix
This page was built for publication: An algorithm for the generalized symmetric tridiagonal eigenvalue problem
