Volume 28, pp. 95-113, 2007-2008.

A refined unsymmetric Lanczos eigensolver for computing accurate eigentriplets of a real unsymmetric matrix

Jean Christophe Tremblay and Tucker Carrington Jr.


For most unsymmetric matrices it is difficult to compute many accurate eigenvalues using the primitive 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.

Full Text (PDF) [2.2 MB], BibTeX

Key words

Eigenproblem, unsymmetric matrices, Lanczos algorithm

AMS subject classifications

15A18, 65F15, 65F50

< Back