Inexact preconditioned conjugate gradient method with inner-outer iteration

SIAM Journal of Scientific Computing

Volumn 21, Issue 4, 1999, Pages 1305-1320

  Golub, Gene H ^a   Ye, Qiang ^b  

^a Stanford University   (United States)

^b UNIVERSITY OF MANITOBA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; MATRIX ALGEBRA;

CONJUGATE GRADIENT METHOD; FACTORIZATION; INEXACT PRECONDITIONER; INNER OUTER ITERATIONS;

ITERATIVE METHODS;

EID: 0033293064     PISSN: 10648275     EISSN: None     Source Type: None    
DOI: 10.1137/S1064827597323415     Document Type: Article

References (12)

1. F.L. BAUER AND A.S. HOUSEHOLDER, Some inequalities involving the Euclidean condition of a matrix, Numer. Math., 2 (1960), pp. 308-311.
2. P. CONCUS, G.H. GOLUB, AND D.P. O'LEARY, A Generalized Conjugate Gradient Method for the Numerical Solution of Elliptic Partial Differential Equations, in Sparse Matrix Computations, J.R. Bunch and D.J. Rose, eds., Academic Press, New York, NY, 1976.
3. H.C. ELMAN AND G.H. GOLUB, Inexact and preconditioned Uzawa algorithms for saddle point problems, SIAM J. Numer. Anal., 31 (1994), pp. 1645-1661.
4. E. GILADI, G.H. GOLUB. AND J.B. KELLER, Inner and outer iterations for the Chebyshev algorithm SIAM J. Numer. Anal., 35 (1998). pp. 300-319.
5. G.H. GOLUB AND M.L. OVERTON. Convergence of a two-stage Richardson iterative procedure for solving systems of linear equations, in Numerical Analysis, G.A. Watson, ed., Lecture Notes in Math. 912, Springer, New York, Heidelberg, Berlin, 1982, pp. 128-139.
6. G.H. GOLUB AND M.L. OVERTON, The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems. Numer. Math., 53 (1988), pp. 571-593.
7. G.H. GOLUB AND C.F. VAN LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore, 1983.
8. G.H. GOLUB AND Q. YE, Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration Technical report 97-04, SCCM, Stanford University, Stanford, CA, 1997.
9. H. MUNTHE-KAAS, The Convergence Rate of Inexact Preconditioned Steepest Descent Algorithm for Solving Linear Systems, Technical report, Department of Computer Science, Stanford University, Stanford, CA, 1987.
10. C.H. TONG AND Q. YE, Analysis of the Finite Precision Bi-Conjugate Gradient Algorithm for Nonsymmetric Linear Systems, Technical report 95-11, SCCM, Stanford University, Stanford, CA, 1995.
11. A. VAN DER SLUIS AND H.A. VAN DER VORST, The rate of convergence of conjugate gradients, Numer. Math., 48 (1986), pp. 543-560.
12. D.M. YOUNG, Iterative Solution of Large Linear Systems, Academic Press, New York, 1971.