IRBL: An implicitly restarted block-Lanczos method for large-scale Hermitian eigenproblems

Document Type

Article

Date of Original Version

4-1-2003

Abstract

The irbleigs code is an implementation of an implicitly restarted block-Lanczos method for computing a few selected nearby eigenvalues and associated eigenvectors of a large, possibly sparse, Hermitian matrix A. The code requires only the evaluation of matrix-vector products with A; in particular, factorization of A is not demanded, nor is the solution of linear systems of equations with the matrix A. This, together with a fairly small storage requirement, makes the irbleigs code well suited for large-scale problems. Applications of the irbleigs code to certain generalized eigenvalue problems and to the computation of a few singular values and associated singular vectors are also discussed. Numerous computed examples illustrate the performance of the method and provide comparisons with other available codes.

Publication Title, e.g., Journal

SIAM Journal on Scientific Computing

Volume

24

Issue

5

Link to Full Text

Share

COinS