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 deation (\locking") and a new type of polynomial filter 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 subintervals independently from one another.
Original language | English (US) |
---|---|
Pages (from-to) | A2512-A2534 |
Journal | SIAM Journal on Scientific Computing |
Volume | 38 |
Issue number | 4 |
DOIs | |
State | Published - 2016 |
Bibliographical note
Publisher Copyright:© 2016 Society for Industrial and Applied Mathematics.
Keywords
- Deation
- Interior eigenvalue problems
- Lanczos algorithm
- Polynomial filtering
- Spectrum slicing
- Thick-restart