Avoiding breakdown in Van der Vorst's method (Q1817789)

The purpose of this paper is to overcome the breakdown of convergence for the Lanczos iterative method and also for \textit{H. A. Van der Vorst} method [SIAM J. Sci. Stat. Comput. 13, No. 2, 631-644 (1992; Zbl 0761.65023)] applied to large sparse linear systems. The authors develop a polynomial method which defines the iterates for the approximate solution of the linear system as quotients of some polynomials having the coefficients expressed in terms of an associated sequence. Numerical examples show that the described algorithm seems to be much more robust than the Lanczos iteration.