Augmented implicitly restarted lanczos bidiagonalization methods

SIAM Journal on Scientific Computing

Volumn 27, Issue 1, 2005, Pages 19-42

  Baglama, James ^a   Reichel, Lothar ^b  

^a University of Rhode Island   (United States)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

Iterative method; Large scale computation; Partial singular value decomposition; Singular value computation

Indexed keywords

HARMONIC ANALYSIS; MATRIX ALGEBRA; VECTORS;

LARGE-SCALE COMPUTATION; PARTIAL SINGULAR VALUE DECOMPOSITION; SINGULAR VALUE COMPUTATION;

COMPUTATIONAL METHODS;

EID: 33244482488     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/04060593X     Document Type: Article

References (33)

1. J. BAGLAMA, D. CALVETTI, AND L. REICHEL, Iterative methods for the computation of a few eigenvalues of a large symmetric matrix, BIT, 36 (1996), pp. 400-421.
2. J. BAGLAMA, D. CALVETTI, AND L. REICHEL, IRBL: An implicitly restarted block-Lanczos method for large-scale Hermitian eigenproblems, SIAM J. Sci. Comput., 24 (2003), pp. 1650-1677.
3. J. BAGLAMA, D. CALVETTI, AND L. REICHEL, Algorithm 827: irbleigs: A MATLAB program for computing a few eigenpairs of a large sparse Hermitian matrix, ACM Trans. Math. Software, 29 (2003), pp. 337-348.
4. Å. BJÖRCK, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
5. Å. BJÖRCK, E. GRIMME, AND P. VAN DOOREN, An implicit shift bidiagonalization algorithm for ill-posed systems, BIT, 34 (1994), pp. 510-534.
6. J. R. BUNCH AND C. P. NIELSEN, Updating the singular decomposition, Numer. Math., 31 (1978), pp. 111-129.
7. D. CALVETTI, L. REICHEL, AND D. C. SORENSEN, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, Electron. Trans. Numer. Anal., 2 (1994), pp. 1-21.
8. P. COMON AND G. H. GOLUB, Tracking a few extreme singular values and vectors in signal processing, Proc. IEEE, 78 (1990), pp. 1327-1343.
9. I. S. DUFF, R. G. GRIMES. AND J. G. LEWIS, User's Guide for the Harwell-Boeing Sparse Matrix Collection (Release I), Technical report TR/PA/92/86, CERFACS, Toulouse, France, 1992. The matrices are available at http://math.nist.gov/MatrixMarket/.
10. G. GOLUB AND W. KAHAN, Calculating the singular values and pseudo-inverse of a matrix, J. Soc. Indust. Appl. Math. Ser. B Numer Anal., 2 (1965), pp. 205-224.
11. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
12. M. GU AND S. C. EISENSTAT, A Stable and Fast Algorithm for Updating the Singular Value Decomposition, Technical report YALEU/DCS/RR-966, Department of Computer Science, Yale University, New Haven, CT, 1993.
13. M. E. HOCHSTENBACH, A Jacobi-Davidson type SVD method, SIAM J. Sci. Comput., 23 (2001), pp. 606-628.
14. M. E. HOCHSTENBACH, Harmonic and refined extraction methods for the singular value problem, with applications to least-squares problems, BIT, to appear.
15. M. E. HOCHSTENBACH, Subspace Methods for Eigenvalue Problems, Ph.D. thesis, Department of Mathematics, University of Utrecht, Utrecht, The Netherlands, 2003; also available online from http://www.case.edu/artsci/math/hochstenbach/.
16. Z. JIA AND D. NIU, An implicitly restarted refined bidiagonalization Lanczos method for computing a partial singular value decomposition, SIAM J. Matrix Anal. Appl., 25 (2003), pp. 246-265.
17. E. KOKIOPOULOU, C. BEKAS, AND E. GALLOPOULOS, Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization, Appl. Numer. Math., 49 (2004), pp. 39-61.
18. R. M. LARSEN, Lanczos bidiagonalization with partial reorthogonalization, Chapter of Ph.D. thesis, Department of Computer Science, University of Aarhus, Aarhus, Denmark, 1998; also available online from http://soi.stanford.edu/~rmunk/.
19. P. LÄUCHLI, Jordan-Elimination und Ausgleichung nach kleinsten Quadraten, Numer. Math., 3 (1961), pp. 226-240.
20. R. B. LEHOUCQ, Implicitly restarted Arnoldi methods and subspace iteration, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 551-562.
21. R. B. LEHOUCQ AND D. C. SORENSEN, Deflation techniques for an implicitly restarted Arnoldi iteration, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 789-821.
22. R. B. LEHOUCQ, D. C. SORENSEN, AND C. YANG, ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, Software Environ. Tools 6, SIAM, Philadelphia, 1998.
23. THE MATHWORKS, INC., MATLAB, Version 6.5 R13, Natick, MA, 2002.
24. R. B. MORGAN, Computing interior eigenvalues of large matrices, Linear Algebra Appl., 154/156 (1991), pp. 289-309.
25. R. B. MORGAN, On restarting the Arnoldi method for large nonsymmetric eigenvalue problems, Math. Comp., 65 (1996), pp. 1213-1230.
26. R. B. MORGAN AND M. ZENG, Harmonic Restarted Arnoldi Algorithm for Calculating Eigenvalues and Determining Multiplicity, preprint, 2003.
27. C. C. PAIGE, B. N. PARLETT. AND H. A. VAN DER VORST, Approximate solutions and eigenvalue bounds from Krylov subspaces, Numer. Linear Algebra Appl., 2 (1995), pp. 115-134.
28. H. D. SIMON AND H. ZHA, Low-rank matrix approximation using the Lanczos bidiagonalization process with applications, SIAM J. Sci. Comput., 21 (2000), pp. 2257-2274.
29. D. C. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
30. D. C. SORENSEN, Numerical methods for large eigenvalue problems, Acta Numer., 11 (2002), pp. 519-584.
31. A. STATHOPOULOS AND Y. SAAD, Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue methods, Electron. Trans. Numer. Anal., 7 (1998), pp. 163-181.
32. A. STATHOPOULOS, Y. SAAD, AND K. WU, Dynamic thick restarting of the Davidson, and the implicitly restarted Arnoldi methods, SIAM J. Sci. Comput., 19 (1998), pp. 227-245.
33. K. WU AND H. SIMON, Thick-restart Lanczos method for large symmetric eigenvalue problems, SIAM J. Matrix Anal. Appl., 22 (2000), pp. 602-616.