Restarting the Lanczos algorithm for large eigenvalue problems and linear equations.

Publication Year:
2008
Usage 1878
Downloads 1369
Abstract Views 509
Repository URL:
http://hdl.handle.net/2104/5219
Author(s):
Nicely, Dywayne A.
Tags:
Eigenvalues.; Algorithms.; Eigenvectors.; Linear systems.; Iterative methods (Mathematics); Orthogonalization methods.
thesis / dissertation description
We are interested in computing eigenvalues and eigenvectors of large matrices and in solving large systems of linear equations. Restarted versions of both the symmetric and nonsymmetric Lanczos algorithms are given. For the symmetric case, we give a method called Lan-DR that simultaneously solves linear equations and computes eigenvalues and eigenvectors. The use of approximate eigenvectors deflates eigenvalues. Maintaining the orthogonality of the Lanczos vectors is a concern. We suggest an approach that is a combination of Parlett and Scott's idea of selective orthogonalization and Simon's partial orthogonalization. For linear systems with multiple right-sides, eigenvectors computed during the solution of the first right-hand side can be used to give much faster convergence of the second and subsequent right-hand sides. A restarted version of the nonsymmetric Lanczos algorithm is developed. Both the right and left eigenvectors are computed while systems of linear equations are solved. We also investigate a restarted two-sided Arnoldi. We compare expense and stability of this approach with restarted nonsymmetric Lanczos.