Nested Lanczos: Implicitly restarting an unsymmetric Lanczos algorithm

Numerical Algorithms

Volumn 18, Issue 1, 1998, Pages 31-50

  De Samblanx, Gorik ^a   Bultheel, Adhemar ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Implicitly Restarted Arnoldi; Two sided Gram Schmidt; Unsymmetric Lanczos

Indexed keywords

EID: 0032333738     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019105012193     Document Type: Article

References (18)

1. Z. Bai, Error analysis of the Lanczos algorithm for the nonsymmetric eigenvalue problem, Math. Comp. 62 (1994) 209-226.
2. C. Brezinski, M. Redivo-Zaglia and H. Sadok, A breakdown-free Lanczos-type algorithm for solving linear systems, Numer. Math. 63(1) (1993) 29-38.
3. A. Bunse-Gerstner, An analysis of the HR algorithm for computing the eigenvalues of a matrix, Linear Algebra Appl. 35 (1981) 155-173.
4. A. Bunse-Gerstner, On the similarity transformation to tridiagonal form, Linear and Multilinear Algebra 12 (1982) 51-56.
5. D. Calvetti, L. Reichel and D.C. Sorensen, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, ETNA 2 (1994) 1-21.
6. R.W. Freund, M.H. Gutknecht and N.M. Nachtigal, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, Part I, SIAM J. Sci. Statist. Comput. 14(1) (1993) 137-158.
7. E.J. Grimme, D.C. Sorensen and P. Van Dooren, Model reduction of state space systems via an implicitly restarted Lanczos method, Numer. Algorithms 12 (1996) 1-32.
8. G. Heinig and K. Rost, Algebraic Methods for Toeplitz-like Matrices and Operators, Mathematical Research, Vol. 19 (Akademie-Verlag, Berlin, 1984) p. 212.
9. C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Stand. 45 (1950) 255-281.
10. R.B. Lehoucq, D.C. Sorensen and P. Vu, ARPACK: An implementation of the Implicitly Re-started Arnoldi Iteration that computes some of the eigenvalues and eigenvectors of a large sparse matrix, available from netlib@ornl.gov under the directory scalapack (1995).
11. R.B. Morgan, On restarting the Arnoldi method for large nonsymmetric eigenvalue problems, Math. Comp. 65 (1996) 1213-1230.
12. 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) 115-133.
13. B.N. Parlett, Reduction to tridiagonal form and minimal realizations, SIAM J. Matrix Anal. Appl. 13(2) (1992) 567-593.
14. B.N. Parlett, D.R. Taylor and Z.A. Liu, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp. 44 (1985) 105-124.
15. Y. Saad, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra Appl. 34 (1980) 269-295.
16. D.C. Sorensen, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl. 13 (1992) 357-385.
17. A. Stathopoulos, Y. Saad and K. Wu, Dynamic thick restarting of the Davidson, and the Implicitly Restarted Arnoldi methods, SIAM J. Sci. Comput., to appear (1997).
18. D.R. Taylor, Analysis of the look-ahead Lanczos algorithm, Ph.D. thesis, University of California, Berkeley (1982).