ACM Transactions on Mathematical Software (TOMS)
Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
Applied Numerical Mathematics - Numerical algorithms, parallelism and applications
The design of a distributed MATLAB-based environment for computing pseudospectra
Future Generation Computer Systems - Special section: Complex problem-solving environments for grid computing
SVD based initialization: A head start for nonnegative matrix factorization
Pattern Recognition
Journal of Computational and Applied Mathematics
The design of a distributed MATLAB-based environment for computing pseudospectra
Future Generation Computer Systems - Special section: Complex problem-solving environments for grid computing
A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
Computers & Mathematics with Applications
A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
Journal of Computational Physics
| Hi-index | 0.01 |
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.