Orthogonal polynomials and the Lanczos method

Volume 29 / 1994

C. Brezinski, H. Sadok, M. Redivo Zaglia Banach Center Publications 29 (1994), 19-33 DOI: 10.4064/-29-1-19-33

Abstract

Lanczos method for solving a system of linear equations is well known. It is derived from a generalization of the method of moments and one of its main interests is that it provides the exact answer in at most n steps where n is the dimension of the system. Lanczos method can be implemented via several recursive algorithms known as Orthodir, Orthomin, Orthores, Biconjugate gradient,... In this paper, we show that all these procedures can be explained within the framework of formal orthogonal polynomials. This theory also provides a natural basis for curing breakdown and near-breakdown in these algorithms. The case of the conjugate gradient squared method can be treated similarly.

Authors

  • C. Brezinski
  • H. Sadok
  • M. Redivo Zaglia

Search for IMPAN publications

Query phrase too short. Type at least 4 characters.

Rewrite code from the image

Reload image

Reload image