Freund, Roland W.; Gutknecht, Martin H.; Nachtigal, Noël M. An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices. (English) Zbl 0770.65022 SIAM J. Sci. Comput. 14, No. 1, 137-158 (1993). The authors present an implementation of a look-ahead version of the Lanczos algorithm. Except for the very special situation of an incurable breakdown, this algorithm overcomes the problems of possible breakdowns and possible instabilities by skipping over those steps in which a breakdown or near breakdown would occur in the standard process. The proposed algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products as the standard Lanczos process without look-ahead. Reviewer: P.Narain (Bombay) Cited in 1 ReviewCited in 95 Documents MSC: 65F15 Numerical computation of eigenvalues and eigenvectors of matrices Keywords:Lanczos method; orthogonal polynomials; look-ahead steps; eigenvalue problems; iterative methods; non-Hermitian matrices; sparse linear systems Software:na1; Harwell-Boeing sparse matrix collection; SPARSKIT; ITSOL PDFBibTeX XMLCite \textit{R. W. Freund} et al., SIAM J. Sci. Comput. 14, No. 1, 137--158 (1993; Zbl 0770.65022) Full Text: DOI Link