Numerical experiments in computing bounds for the norm of the error in the preconditioned conjugate gradient algorithm

Numerical Algorithms

Volumn 22, Issue 3-4, 1999, Pages 353-365

  Meurant, Gérard ^a  

^a CEA DIF   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043138868     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1019179412560     Document Type: Article

References (9)

1. Z. Bai and G.H. Golub, Bounds for the trace of the inverse and the determinant of symmetric positive definite matrices, Ann. Numer. Math. 4 (1997) 29-38.
2. M. Benzi, C.D. Meyer and M. Tuma, A sparse approximate inverse preconditioner for the conjugate gradient method, SIAM J. Sci. Comput. 17 (1996) 1135-1149.
3. B. Fischer and G.H. Golub, On the error computation for polynomial based iteration methods, Report NA 92-21, Stanford University (1992).
4. G.H. Golub and G. Meurant, Matrices, moments and quadrature, in: Numerical Analysis 1993, eds. D.F. Griffiths and G.A. Watson, Pitman Research Notes in Mathematics, Vol. 303 (1994) pp. 105-156.
5. G.H. Golub and G. Meurant, Matrices, moments and quadrature II or how to compute the norm of the error in iterative methods, BIT 37(3) (1997) 687-705.
6. G.H. Golub and Z. Strakoš, Estimates in quadratic formulas, Numer. Algorithms 8(2-4) (1994).
7. G.H. Golub and C. Van Loan, Matrix Computations (Johns Hopkins Univ. Press, Baltimore, MD, 1989).
8. G. Meurant, The computation of bounds for the norm of the error in the conjugate gradient algorithm, Numer. Algorithms 16 (1997) 77-87.
9. G. Meurant, Computer Solution of Large Linear Systems (North-Holland, Amsterdam, 1999).