A Thick-Restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems

2015/12/26 by Li, Ruipeng, Xi, Yuanzhe, Vecharynski, Eugene +2 · 1 citation
#FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.1512.08135

Abstract

Polynomial filtering can provide a highly effective means of computing all eigenvalues of a real symmetric (or complex Hermitian) matrix that are located in a given interval, anywhere in the spectrum. This paper describes a technique for tackling this problem by combining a Thick-Restart version of the Lanczos algorithm with deflation (`locking') and a new type of polynomial filters obtained from a least-squares technique. The resulting algorithm can be utilized in a `spectrum-slicing' approach whereby a very large number of eigenvalues and associated eigenvectors of the matrix are computed by extracting eigenpairs located in different sub-intervals independently from one another.

Cited by

• Polynomial Preconditioning for Indefinite Matrices

Related

• Fast computation of spectral densities for generalized eigenvalue problems
• Structure Preserving Restarts of the Non-Symmetric Lanczos Algorithm via the Implicitly shifted LR algorithm
• Efficient Computation of Dominant Eigenvalues Using Adaptive Block Lanczos with Chebyshev Filtering
• TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
• The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software