A REFINED UNSYMMETRIC LANCZOS EIGENSOLVER FOR COMPUTING ACCURATE EIGENTRIPLETS OF A REAL UNSYMMETRIC MATRIX
Jean Christophe Tremblay, Tucker Carrington
Abstract
Jean Christophe Tremblay, Tucker Carrington
Abstract
For most unsymmetric matrices it is difficult to compute many accurate eigenvalues using the prim- itive form of the unsymmetric Lanczos algorithm (ULA). In this paper we propose a modification of the ULA. It is related to ideas used in (J. Chem. Phys. 122 (2005), 244107 (11 pages)) to compute resonance lifetimes. Using the refined ULA we suggest, the calculation of accurate extremal and interior eigenvalues is feasible. The refinement is simple: approximate right and left eigenvectors computed using the ULA are used to form a small projected matrix whose eigenvalues and eigenvectors are easily computed. There is no re-biorthogonalization of the Lanczos vectors and no need to store large numbers of vectors in memory. The method can therefore be used to compute eigenvalues of very large matrices. The idea is tested on several matrices.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For most unsymmetric matrices it is difficult to compute many accurate eigenvalues using the prim- itive form of the unsymmetric Lanczos algorithm (ULA). In this paper we propose a modification of the ULA. It is related to ideas used in (J. Chem. Phys. 122 (2005), 244107 (11 pages)) to compute resonance lifetimes. Using the refined ULA we suggest, the calculation of accurate extremal and interior eigenvalues is feasible. The refinement is simple: approximate right and left eigenvectors computed using the ULA are used to form a small projected matrix whose eigenvalues and eigenvectors are easily computed. There is no re-biorthogonalization of the Lanczos vectors and no need to store large numbers of vectors in memory. The method can therefore be used to compute eigenvalues of very large matrices. The idea is tested on several matrices.
Key concepts: Lanczos resampling, Eigenvalues and eigenvectors, Lanczos algorithm, Matrix (chemical analysis), Simple (philosophy), Mathematics, Algebra over a field, Algorithm