Abstract
In this text, we present a generalization of the idea of the Implicitly Restarted Arnoldi method to the unsymmetric Lanczos algorithm, using the two-sided Gram-Schmidt process or using a full Lanczos tridiagonalization. The resulting implicitly restarted Lanczos method is called Nested Lanczos. Nested Lanczos can be combined with an implicit filter. It can also be used in case of breakdown and offers an alternative for look-ahead.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Z. Bai, Error analysis of the Lanczos algorithm for the nonsymmetric eigenvalue problem, Math. Comp. 62 (1994) 209-226.
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.
A. Bunse-Gerstner, An analysis of the HR algorithm for computing the eigenvalues of a matrix, Linear Algebra Appl. 35 (1981) 155-173.
A. Bunse-Gerstner, On the similarity transformation to tridiagonal form, Linear and Multilinear Algebra 12 (1982) 51-56.
D. Calvetti, L. Reichel and D.C. Sorensen, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, ETNA 2 (1994) 1-21.
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.
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.
G. Heinig and K. Rost, Algebraic Methods for Toeplitz-like Matrices and Operators, Mathematical Research, Vol. 19 (Akademie-Verlag, Berlin, 1984) p. 212.
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.
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).
R.B. Morgan, On restarting the Arnoldi method for large nonsymmetric eigenvalue problems, Math. Comp. 65 (1996) 1213-1230.
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.
B.N. Parlett, Reduction to tridiagonal form and minimal realizations, SIAM J. Matrix Anal. Appl. 13(2) (1992) 567-593.
B.N. Parlett, D.R. Taylor and Z.A. Liu, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp. 44 (1985) 105-124.
Y. Saad, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra Appl. 34 (1980) 269-295.
D.C. Sorensen, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl. 13 (1992) 357-385.
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).
D.R. Taylor, Analysis of the look-ahead Lanczos algorithm, Ph.D. thesis, University of California, Berkeley (1982).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
De Samblanx, G., Bultheel, A. Nested Lanczos: implicitly restarting an unsymmetric Lanczos algorithm. Numerical Algorithms 18, 31–50 (1998). https://doi.org/10.1023/A:1019105012193
Issue Date:
DOI: https://doi.org/10.1023/A:1019105012193