An adaptive block Lanczos algorithm

Numerical Algorithms

Volumn 12, Issue 1, 1996, Pages 97-110

  Ye, Qiang ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Adaptive algorithm; Block Lanczos algorithm; Misconvergence

Indexed keywords

EID: 21344453446     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02141743     Document Type: Article

References (27)

1. C. Brezinski, M. Redivo-Zaglia and H. Sadok, Avoiding breakdown and near-breakdown in Lanczos-type algorithms, Numer. Algor. 1 (1991) 261-284.
2. T.F. Chan and H.C. Elman, Fourier analysis of iterative methods for elliptic boundary value problems, SIAM Rev. 31 (1989) 20-49.
3. J. Cullum and W.E. Donath, A block Lanczos algorithm for computing the Q algebraically largest eigenvalues and a corresponding eigenspace of large, sparse real symmetric matrices, Proc. 1974 IEEE Conf. on Decision and Control, Phoenix, AZ (1974) pp. 505-509.
4. J. Cullum and R. A. Willoughby, Lanczos and computation in specified intervals of the spectrum of large, sparse real symmetric matrices, in: Sparse Matrix Proc., eds. I.S. Duff and G.W. Stewart (SIAM, Philadelphia, 1978) pp. 220-256.
5. J. Cullum and R.A. Willoughby, Lanczos Algorithms for Large Symmetric Eigenvalue Computations (Birkhauser, Boston, 1985).
6. R.W. Freund, M.H. Gutknecht and N.M. Nachtigal, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Statist. Comp. 14 (1993) 137-158.
7. J.W. Danial, W.B. Gragg, L. Kaufman and G.W. Stewart, Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization, Math. Comp. 30 (1976) 772-793.
8. T. Ericsson and A. Ruhe, The spectral transformation Lanczos method, Math. Comp. 34 (1980) 1251-1268.
9. G.H. Golub and R. Underwood, The block Lanczos method for computing eigenvalues, in: Mathematical Software III, ed. J. Rice (Academic, New York, 1977) pp. 364-377.
10. G.H. Golub and C.F. Van Loan, Matrix Computations (The Johns Hopkins University Press, Baltimore, 1983).
11. R.G. Grimes, J.G. Lewis an H.D. Simon, A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems, SIAM J. Matrix Anal. Appl. 15 (1994) 228-272.
12. M.H. Gutknecht, A completed theory of the unsymmetric Lanczos process and related algorithms, Part I, SIAM J. Matrix Anal. Appl. 13 (1992) 594-639.
13. J.D. Kress, S. Woodruff, G. Parker and R. Pack, Some strategy for enhancing the performance of the block Lanczos method, Comp. Phys. Comm. 53 (1989) 109-115.
14. C. Lanczos, An iteration method for the solutions of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Stand. 45 (1950) 255-282.
15. B.N. Parlett, The Symmetric Eigenvalue Problem (Prentice-Hall, Englewood Cliffs, NJ, 1980).
16. B.N. Partlett and B. Nour-Omid, The use of a refined error bound when updating eigenvalues of tridiagonals, Lin. Alg. Appl. 68 (1985) 179-219.
17. B.N. Partlett and D.S. Scott, The Lanczos algorithm with selective orthogonalization, Math. Comp. 33 (1979) 217-238.
18. B.N. Partlett, H. Simon and L.M. Stringer, On estimating the largest eigenvalue with the Lanczos algorithm, Math. Comp. 38 (1982) 153-166.
19. B.N. Partlett, D.R. Taylor and Z.A. Liu, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp. 44 (1985) 105-124.
20. Y. Saad, On the rates of convergence of the Lanczos and the block Lanczos methods, SIAM J. Numer. Anal. 17 (1980) 687-706.
21. H.D. Simon, The Lanczos algorithm with partial reorthogonalization, Math. Comp. 42 (1984) 115-136.
22. D.S. Scott, The Lanczos algorithm, in: Sparse Matrices and Their Uses, ed. I. Duff (Academic Press, London, 1981) pp. 139-159.
23. R. Underwood, An iterative block Lanczos method for the solution of large sparse symmetric eigenproblems, Report STAN-CS-75-496, Computer Science, Stanford University, Stanford, CA (1975).
24. A. van der Sluis and H.A. van der Vorst, The convergence behavior of Ritz values in the presence of close eigenvalues, Lin. Alg. Appl. 88-89 (1987) 651-694.
25. Q. Ye, A convergence analysis of nonsymmetric Lanczos algorithms, Math. Comp. 56 (1991) 677-691.
26. Q. Ye, A breakdown-free variation of the nonsymmetric Lanczos algorithm, Math. Comp. 62 (1994) 179-207.
27. A. Yeremin and A. Nikishin, Variable block CG methods, talk in AMS-SIAM Summer Research Conf. on Linear and Nonlinear Conjugate Gradient Related Methods, Seattle, Washington (1995).