Generalized eigenvalue problems: Lanczos algorithm with a recursive partitioning method

DOI10.1016/S0898-1221(00)00077-8zbMath0954.65031MaRDI QIDQ1568739

N. Delaunay

Publication date: 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

comparison of methods; numerical results; eigenvectors; Krylov subspace method; Lanczos algorithm; smallest eigenvalues; recursive parititioning method; Sturm sequence-bisection method

Mathematics Subject Classification ID

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

Uses Software

• NAPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On certain methods for expanding the characteristic polynomial
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• A generalized nonsymmetric Lanczos procedure
• A parallel triangular decomposition algorithm on a workstation network with application to structural vibration analysis
• Computing eigenvalues: Lanczos algorithm with a new recursive partitioning method
• Eigenvalues of perturbed Hermitian matrices
• Lanczos versus subspace iteration for solution of eigenvalue problems
• How to Implement the Spectral Transformation
• The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
• The truncated Lanczos algorithm for partial solution of the symmetric eigenproblem
• The Lanczos Algorithm with Selective Orthogonalization
• Solution of eigenvalue problems by sturm sequence method
• Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection