Preconditioned Krylov subspace methods for eigenvalue problems
- Univ. of Minnesota, Minneapolis, MN (United States)
Lanczos algorithm is a commonly used method for finding a few extreme eigenvalues of symmetric matrices. It is effective if the wanted eigenvalues have large relative separations. If separations are small, several alternatives are often used, including the shift-invert Lanczos method, the preconditioned Lanczos method, and Davidson method. The shift-invert Lanczos method requires direct factorization of the matrix, which is often impractical if the matrix is large. In these cases preconditioned schemes are preferred. Many applications require solution of hundreds or thousands of eigenvalues of large sparse matrices, which pose serious challenges for both iterative eigenvalue solver and preconditioner. In this paper we will explore several preconditioned eigenvalue solvers and identify the ones suited for finding large number of eigenvalues. Methods discussed in this paper make up the core of a preconditioned eigenvalue toolkit under construction.
- Research Organization:
- Front Range Scientific Computations, Inc., Lakewood, CO (United States)
- OSTI ID:
- 433397
- Report Number(s):
- CONF-9604167-Vol.1; ON: DE96015306; TRN: 97:000720-0072
- Resource Relation:
- Conference: Copper Mountain conference on iterative methods, Copper Mountain, CO (United States), 9-13 Apr 1996; Other Information: PBD: [1996]; Related Information: Is Part Of Copper Mountain conference on iterative methods: Proceedings: Volume 1; PB: 422 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Preconditioned iterations to calculate extreme eigenvalues
Preconditioning bandgap eigenvalue problems in three-dimensional photonic crystals simulations