×

Implicitly restarted Arnoldi/Lanczos methods for large scale eigenvalue calculations. (English) Zbl 0865.65019

Keyes, David E. (ed.) et al., Parallel numerical algorithms. Proceedings of the workshop, Hampton, VA, May 23–25, 1994. Dordrecht: Kluwer Academic Publishers. ICASE/LaRC Interdisciplinary Series in Science and Engineering. 4, 119-165 (1997).
Summary: Eigenvalues and eigenfunctions of linear operators are important to many areas of applied mathematics. The ability to approximate these quantities numerically is becoming increasingly important in a wide variety of applications. This increasing demand has fueled interest in the development of new methods and software for the numerical solution of large-scale algebraic eigenvalue problems. In turn, the existence of these new methods and software, along with the dramatically increased computational capabilities now available, has enabled the solution of problems that would not even have been posed five or ten years ago. Until very recently, software for large-scale nonsymmetric problems was virtually non-existent. Fortunately, the situation is improving rapidly.
The purpose of this article is to provide an overview of the numerical solution of large-scale algebraic eigenvalue problems. The focus will be on a class of methods called Krylov subspace projection methods. The well-known Lanczos method is the premier member of this class. The Arnoldi method generalizes the Lanczos method to the nonsymmetric case. A recently developed variant of the Arnoldi/Lanczos scheme called the implicitly restarted Arnoldi method is presented here in some depth. This method is highlighted because of its suitability as a basis for software development.
For the entire collection see [Zbl 0857.00034].

MSC:

65F15 Numerical computation of eigenvalues and eigenvectors of matrices

Software:

SRRIT; VanHuffel
PDFBibTeX XMLCite