An efficient implementation of the nonsymmetric Lanczos algorithm

SIAM Journal on Matrix Analysis and Applications

Volumn 18, Issue 3, 1997, Pages 566-589

  Day, David ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Biorthogonalization methods; Breakdown; Lanczos algorithm; Sparse eigenvalue problems

Indexed keywords

EID: 0031529238     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479895292503     Document Type: Article

References (39)

1. Z. BAI (1992), Error analysis of the Lanczos algorithm for the nonsymmetric eigenvalue problem, Math. Comp., 62, pp. 209-226.
2. H and LU decompositions, BIT, 31, pp. 358-363.
3. Z. BAI, D. DAY, AND Q. YE (1995), ABLE: An Adaptive Block Lanczos Method of the Eigenvalue Problem, Technical report 95-07, Mathematics Department, University of Kentucky, Lexington, KY.
4. D. BOLEY AND G. GOLUB (1990), The nonsymmetric Lanczos algorithm and controllability, Systems Control Lett., 16, pp. 97-105.
5. J. CULLUM AND R. WILLOUGHBY (1985), Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Birkhäuser Boston, Cambridge, MA.
6. J. CULLUM, W. KERNER, AND R. WILLOUGHBY (1989), A generalized nonsymmetric Lanczos procedure, Comp. Phys. Comm., 53, pp. 19-48.
7. D. DAY (1993), Semi-Duality in the Two-Sided Lanczos Algorithm, Ph.D. thesis, University of California, Berkeley, CA.
8. D. DAY (1995), The differential QD algorithm for the tridiagonal eigenvalue problem, manuscript.
9. T. ERICSSON AND A. RUHE (1980), The spectral transformation Lanczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems, Math. Comp., 35, pp. 1251-1268.
10. R. FREUND, M. GUTKNECHT, AND N. NACHTIGAL (1993), An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Stat. Comput., 14, pp. 137-158.
11. R. GRIMES, J. LEWIS, AND H. SIMON (1994), A shifted block Lanczos algorithm for solving generalized eigenproblems, SIAM J. Matrix Anal. Appl., 15, pp. 228-272.
12. E. GRIMME, D. SORENSEN, AND P. VAN DOOREN (1994), Model Reduction of State Space Systems via an Implicitly Restarted Lanczos Method, TR94-21, Rice University, Houston, TX.
13. M. GUTKNECHT (1992), A completed theory of the unsymmetric Lanczos process and related algorithms, SIAM J. Matrix Anal. Appl., Part I, 13, pp. 594-639, Part II, 15, pp. 15-58.
14. M. GUTKNECHT (1992), A completed theory of the unsymmetric Lanczos process and related algorithms, SIAM J. Matrix Anal. Appl., Part I, 13, pp. 594-639, Part II, 15, pp. 15-58.
15. W. KAHAN, B. PARLETT, AND E. JIANG (1982), Residual bounds on approximate eigensystems of nonnormal matrices, SIAM J. Numer. Anal., 19, pp. 470-484.
16. R. LEHOUCQ (1995), Analysis and Implementation of an Implicitly Restarted Arnoldi Iteration, TR95-13, Rice University, Houston, TX.
17. C. LANCZOS (1950), An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Stand., 45, pp. 255-282.
18. A. OSTROWSKI (1937), Über die determinanten mit über wiegender hauptdiagonale, Commet. Math. Helv., 10, pp. 69-96 (1937) or Alexander Ostrowski Collected Mathematical Papers 1, Birkhaüser-Verlag, pp. 31-59 (1983).
19. A. OSTROWSKI (1937), Über die determinanten mit über wiegender hauptdiagonale, Commet. Math. Helv., 10, pp. 69-96 (1937) or Alexander Ostrowski Collected Mathematical Papers 1, Birkhaüser-Verlag, pp. 31-59 (1983).
20. B. PARLETT (1974), The Rayleigh quotient algorithm iteration and some generalizations for nonnormal matrices, Math. Comp., 28, pp. 679-693.
21. B. PARLETT AND D. SCOTT (1979), The Lanczos algorithm with selective orthogonalization, Math. Comp., 33, pp. 217-238.
22. B. PARLETT (1980), The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ.
23. B. PARLETT, D. TAYLOR, AND Z.-S. LIU (1985), A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp., 44, pp. 105-124.
24. B. PARLETT (1992), Reduction to tridiagonal form and minimal realizations, SIAM J. Matrix Anal. Appl., 13, pp. 567-593.
25. B. PARLETT (1992), The rewards for maintaining semi-orthogonality among Lanczos vectors, J. Numer. Linear Algebra Appl., 1, pp. 243-267.
26. B. PARLETT, B. NOUR OMID, AND Z.-S. LIU (1985), How to Maintain Semi-Orthogonality Among Lanczos Vectors, CPAM-420, Center for Pure and Applied Mathematics, University of California, Berkeley, CA.
27. A. RUHE (1993), The two-sided Arnoldi algorithm for nonsymmetric eigenvalue problems, in Matrix Pencils, LNM 973, B. Kågström and A. Ruhe, eds., Springer-Verlag, Berlin, Heidelberg, New York, pp. 104-120.
28. A. RUHE (1995). Rational Krylov, A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils, Report UCB/CSD-95-871, Computer Science Division (EECS), University of California, Berkeley, CA.
29. Y. SAAD (1980). Variations of Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra Appl., 34, pp. 269-295.
30. H. SIMON (1984), Analysis of the symmetric Lanczos algorithm with reorthogonalization, Linear Algebra Appl., 61, pp. 101-131.
31. H. SIMON (1984), The Lanczos algorithm with partial reorthogonalization, Math. Comp., 42, pp. 115-142.
32. D. SORENSEN (1992), Implicit application of polynomial filters in a k-step Arnoldi process, SIAM J. Matrix Anal. Appl., 13, pp. 357-385.
33. G. STEWART AND J. SUN (1990), Matrix Perturbation Theory, Academic Press, New York.
34. G. STEWART (1993), On the perturbation of LU, Cholesky, and QR factorizations, SIAM J. Matrix Anal. Appl., 14, pp. 1141-1145.
35. J. G. SUN (1991), Perturbation bounds for the Cholesky and QR factors, BIT, 31, pp. 341-352.
36. J. G. SUN (1992), Component-wise perturbation bounds for some matrix decompositions, BIT, 32, pp. 702-714.
37. C. TONG AND Q. YE (1995), Analysis of the Finite Precision Bi-Conjugate Gradient Algorithm for Nonsymmetric Linear Systems, preprint.
38. H. I. VAN DER VEEN AND K. VUIK (1995), Bi-Lanczos with partial orthogonalization, Computers and Structures, 56, pp 605-613.
39. J. WILKINSON (1965), The Algebraic Eigenvalue Problem, Oxford University Press, Oxford, UK.