Abstract
The conjugate gradient method is one of the most popular iterative methods for computing approximate solutions of linear systems of equations with a symmetric positive definite matrix A. It is generally desirable to terminate the iterations as soon as a sufficiently accurate approximate solution has been computed. This paper discusses known and new methods for computing bounds or estimates of the A-norm of the error in the approximate solutions generated by the conjugate gradient method.
Similar content being viewed by others
References
C. Brezinski, Error estimates for the solution of linear systems, SIAM J. Sci. Comput. 21 (1999) 764–781.
D. Calvetti, S. Morigi, L. Reichel and F. Sgallari, An iterative method with error estimators, J. Comput. Appl. Math., to appear.
D. Calvetti and L. Reichel, A hybrid iterative method for symmetric positive definite linear systems, Numer. Algorithms 11 (1996) 79–98.
D. Calvetti, L. Reichel and F. Sgallari, Application of anti-Gauss quadrature rules in linear algebra, in: Applications and Computation of Orthogonal Polynomials, eds. W. Gautschi, G.H. Golub and G. Opfer (Birkhäuser, Basel, 1999) pp. 41–56.
G. Dahlquist, S.C. Eisenstat and G.H. Golub, Bounds for the error of linear systems of equations using the theory of moments, J. Math. Anal. Appl. 37 (1972) 151–166.
G. Dahlquist, G.H. Golub and S.G. Nash, Bounds for the error in linear systems, in: Semi-Infinite Programming, ed. R. Hettich, Lecture Notes in Control and Computer Science, Vol.15 (Springer, Berlin, 1979) pp. 154–172.
B. Fischer and G.H. Golub, On the error computation for polynomial based iterative methods, in: Recent Advances in Iterative Methods, eds. G. Golub, A. Greenbaum and M. Luskin (Springer, New York, 1994) pp. 59–67.
G.H. Golub and G. Meurant, Matrices, moments and quadrature, in: Numerical Analysis 1993, eds. D.F. Griffiths and G.A. Watson (Longman, Essex, 1994) pp. 105–156.
G.H. Golub and G. Meurant, Matrices, moments and quadrature II: How to compute the norm of the error in iterative methods, BIT 37 (1997) 687–705.
G.H. Golub and Z. Strakos, Estimates in quadratic formulas, Numer. Algorithms 8 (1994) 241–268.
G.H. Golub and C.F. Van Loan, Matrix Computations, 3rd ed. (Johns Hopkins Univ. Press, Baltimore, MD, 1996).
D.P. Laurie, Anti-Gaussian quadrature formulas, Math. Comp. 65 (1996) 739–747.
G. Meurant, The computation of bounds for the norm of the error in the conjugate gradient algorithm, Numer. Algorithms 16 (1997) 77–87.
G. Meurant, Numerical experiments in computing bounds for the norm of the error in the preconditioned conjugate gradient algorithm, Numer. Algorithms 22 (1999) 353–365.
Y. Saad, Iterative Methods for Sparse Linear Systems (PWS, Boston, 1996).
J. Stoer and R. Bulirsch, Introduction to Numerical Analysis, 2nd ed. (Springer, New York, 1993).
R.S. Varga, Matrix Iterative Analysis, 2nd ed. (Springer, Berlin, 2000).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Calvetti, D., Morigi, S., Reichel, L. et al. Computable error bounds and estimates for the conjugate gradient method. Numerical Algorithms 25, 75–88 (2000). https://doi.org/10.1023/A:1016661024093
Issue Date:
DOI: https://doi.org/10.1023/A:1016661024093