On error estimation in the conjugate gradient method and why it works in finite precision computations
Electronic transactions on numerical analysis, Tome 13 (2002), pp. 56-80.

Voir la notice de l'article provenant de la source Electronic Library of Mathematics

Summary: In their paper published in 1952, Hestenes and Stiefel considered the conjugate gradient (CG) method an iterative method which terminates in at most n steps if no rounding errors are encountered [24, p. 410]. They also proved identities for the A-norm and the Euclidean norm of the error which could justify the stopping criteria [24, Theorems 6:1 and 6:3, p. 416]. The idea of estimating errors in iterative methods, and in the CG method in particular, was independently (of these results) promoted by Golub; the problem was linked to Gauss quadrature and to its modifications [7], [8]. A comprehensive summary of this approach was given in [15], [16]. During the last decade several papers developed error bounds algebraically without using Gauss quadrature. However, we have not found any reference to the corresponding results in [24]. All the existing bounds assume exact arithmetic. Still they seem to be in a striking agreement with finite precision numerical experiments, though in finite precision computations they estimate quantities which can be orders of magnitude different from their exact precision counterparts! For the lower bounds obtained from Gauss quadrature formulas this nontrivial phenomenon was explained, with some limitations, in [17]. In our paper we show that the lower bound for the A-norm of the error based on Gauss quadrature ([15], [17], [16]) is mathematically equivalent to the original formula of Hestenes and Stiefel [24]. We will compare existing bounds and we will demonstrate necessity of a proper rounding error analysis: we present an example of the well-known bound which can fail in finite precision arithmetic. We will analyse the simplest bound based on [24, Theorem 6:1], and prove that it is numerically stable. Though we concentrate mostly on the lower bound for the A-norm of the error, we describe also an estimate for the Euclidean norm of the error based on [24, Theorem 6:3].
Classification : 15A06, 65F10, 65F25, 65G50
Keywords: conjugate gradient method, Gauss quadrature, evaluation of convergence, error bounds, finite precision arithmetic, rounding errors, loss of orthogonality
@article{ETNA_2002__13__a3,
     author = {Strako\v{s}, Zden\v{e}k and Tich\'y, Petr},
     title = {On error estimation in the conjugate gradient method and why it works in finite precision computations},
     journal = {Electronic transactions on numerical analysis},
     pages = {56--80},
     publisher = {mathdoc},
     volume = {13},
     year = {2002},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ETNA_2002__13__a3/}
}
TY  - JOUR
AU  - Strakoš, Zdeněk
AU  - Tichý, Petr
TI  - On error estimation in the conjugate gradient method and why it works in finite precision computations
JO  - Electronic transactions on numerical analysis
PY  - 2002
SP  - 56
EP  - 80
VL  - 13
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ETNA_2002__13__a3/
LA  - en
ID  - ETNA_2002__13__a3
ER  - 
%0 Journal Article
%A Strakoš, Zdeněk
%A Tichý, Petr
%T On error estimation in the conjugate gradient method and why it works in finite precision computations
%J Electronic transactions on numerical analysis
%D 2002
%P 56-80
%V 13
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ETNA_2002__13__a3/
%G en
%F ETNA_2002__13__a3
Strakoš, Zdeněk; Tichý, Petr. On error estimation in the conjugate gradient method and why it works in finite precision computations. Electronic transactions on numerical analysis, Tome 13 (2002), pp. 56-80. http://geodesic.mathdoc.fr/item/ETNA_2002__13__a3/