Matrices, moments and quadrature II; How to compute the norm of the error in iterative methods
- 215 Downloads
In this paper, we study the numerical computation of the errors in linear systems when using iterative methods. This is done by using methods to obtain bounds or approximations of quadratic formsu T A −1 u whereA is a symmetric positive definite matrix andu is a given vector. Numerical examples are given for the Gauss-Seidel algorithm.
Moreover, we show that using a formula for theA-norm of the error from Dahlquist, Golub and Nash  very good bounds of the error can be computed almost for free during the iterations of the conjugate gradient method leading to a reliable stopping criterion.
AMS subject classification65F50
Key wordsIterative methods error computation conjugate gradient
Unable to display preview. Download preview PDF.
- 2.G. Dahlquist, G. H. Golub, and S. G. Nash,Bounds for the error in linear systems, in Proceedings of the Workshop on Semi-Infinite Programming, R. Hettich, ed., Springer, 1978, pp. 154–172.Google Scholar
- 3.B. Fischer and G. H. Golub,On the error computation for polynomial based iteration methods, Tech. Report NA 92-21, Stanford University, 1992.Google Scholar
- 4.G. H. Golub,Matrix computation and the theory of moments, in Proceedings of the International Congress of Mathematicians, Birkhäuser, 1995.Google Scholar
- 5.G. H. Golub and G. Meurant,Matrices moments and quadrature, in Numerical Analysis 1993, D. F. Griffiths and G. A. Watson, eds., Pitman Research Notes in Mathematics, v 303, 1994, pp. 105–156.Google Scholar
- 6.G. H. Golub and Z. Strakoš,Estimates in quadratic formulas, Tech. Report SCCM-93-08, Stanford University, to appear in Numerical Algorithms.Google Scholar