Iteration number for the conjugate gradient method

Owe Axelsson

Mathematics and Computers in Simulation (MATCOM), 2003, vol. 61, issue 3, 421-435

Abstract: When solving linear systems and, in particular when solving large scale ill-conditioned problems it is important to understand the behaviour of the conjugate gradient method. The conjugate gradient method converges typically in three phases, an initial phase of rapid convergence but short duration, which depends essentially only on the initial error, a fairly linearly convergent phase, which depends on the spectral condition number and finally a superlinearly convergent phase, which depends on how the smallest eigenvalues are distributed. In the paper, this is explained by proper estimates of the rate of convergence.

Keywords: Iteration number; Conjugate gradient method; Eigenvalues (search for similar items in EconPapers)
Date: 2003
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475402000976
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:61:y:2003:i:3:p:421-435

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().