Summary.
A breakdown (due to a division by zero) can arise in the algorithms for implementing Lanczos' method because of the non-existence of some formal orthogonal polynomials or because the recurrence relationship used is not appropriate. Such a breakdown can be avoided by jumping over the polynomials involved. This strategy was already used in some algorithms such as the MRZ and its variants. In this paper, we propose new implementations of the recurrence relations of these algorithms which only need the storage of a fixed number of vectors, independent of the length of the jump. These new algorithms are based on Horner's rule and on a different way for computing the coefficients of the recurrence relationships. Moreover, these new algorithms seem to be more stable than the old ones and they provide better numerical results. Numerical examples and comparisons with other algorithms will be given.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received September 2, 1997 / Revised version received July 24, 1998
Rights and permissions
About this article
Cite this article
Brezinski, C., Redivo Zaglia, M. & Sadok, H. New look-ahead Lanczos-type algorithms for linear systems. Numer. Math. 83, 53–85 (1999). https://doi.org/10.1007/s002110050439
Issue Date:
DOI: https://doi.org/10.1007/s002110050439