A ``look-around Lanczos'' algorithm for solving a system of linear equations
The author proposes two iterative algorithms to solve large sparse linear systems of equations. The first one is a modification of Lanczos' method and the second is based on one of Brezinski's extrapolation methods. Lanczos methods may break down [see e.g. \textit{R. W. Freund, M. H. Gutknecht} and \textit{N. M. Nachtigal}, SIAM J. Sci. Comput 14, No. 1, 137-158 (1993; Zbl 0770.65022)] and have to be stabilized by a look-ahead strategy. The author proposes a new ``look-around Lanczos'' algorithm to overcome these problems.
scientific article; zbMATH DE number 1129529