On the sublinear and superlinear rate of convergence of conjugate gradient methods

Numerical Algorithms

Volumn 25, Issue 1-4, 2000, Pages 1-22

  Axelsson, Owe ^a   Kaporin, Igor ^b  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b RUSSIAN ACADEMY OF SCIENCES   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034560792     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1016694031362     Document Type: Article

References (22)

1. L. Andersson, SSOR preconditioning of Toeplitz matrices, Ph.D. thesis, Chalmers University of Technology, Göteborg, Sweden (1976).
2. O. Axelsson, A class of iterative methods for finite element equations, Comput. Methods Appl. Mech. Engrg. 9 (1976) 123-137.
3. O. Axelsson, A restarted version of a generalized preconditioned conjugate gradient method, Commun. Appl. Numer. Methods 4 (1988) 521-530.
4. O. Axelsson, Bounds of eigenvalues of preconditioned matrices, SIAM J. Matrix Anal. 13 (1992) 847-862.
5. O. Axelsson, On the rate of convergence of the conjugate gradient method, in: Proc. of '92 Shanghai Internat. Numerical Algebra and Its Applications Conference, ed. J. Er-Xiong (China Science and Technology Press, 1993) pp. 13-32.
6. O. Axelsson, Condition numbers for the study of the rate of convergence of the conjugate gradient method, in: Proc. of the 2nd IMACS Internat. Symposium on Iterative Methods in Linear Algebra, Blagoevgrad, Bulgaria, 17-20 June 1995, pp. 3-33.
7. O. Axelsson, Iterative Solution Methods (Cambridge Univ. Press, New York, 1994).
8. O. Axelsson and G. Lindskog, On the rate of convergence of the preconditioned conjugate gradient method, Numer. Math. 48 (1986) 499-523.
9. O. Axelsson, M. Neytcheva and B. Polman, The bordering method as a preconditioning method, Vestnik Moscow University Ser. 15, Vychisl. Math. Cybernet. (1995) 3-24.
10. O. Axelsson and M. Nikolova, A generalized conjugate gradient minimum residual method (GCG-MR) with variable preconditioners and a relation between residuals of the GCG-MR and GCG-OR methods, Commun. Appl. Anal. 1(3) (1997) 371-388.
11. A. Greenbaum, Comparison of splittings used with the conjugate gradient algorithm, Numer. Math. 33 (1979) 181-194.
12. A. Greenbaum and Z. Strakos, Predicting the behaviour of finite precision Lanczos and conjugate gradient computations, SIAM J. Matrix Anal. Appl. 13 (1992) 121-137.
13. R.M. Hayes, Iterative methods for solving linear problems in Hilbert spaces, in: Contributions to the Solutions of Systems of Linear Equations and the Determination of Eigenvalues, ed. O. Tausky, Nat. Bur. Standards Appl. Math. Ser., Vol. 39 (Washington, DC, 1954) pp. 71-103.
14. A. Jennings, Influence of the eigenvalue spectrum on the convergence rate of the conjugate gradient method, J. Inst. Math. Appl. 20 (1977) 61-72.
15. I.E. Kaporin, Two-level explicit preconditionings for the conjugate gradient method, Differential Equations 28 (1992) 280-289.
16. I.E. Kaporin, New convergence results and preconditioning strategies for the conjugate gradient method, Numer. Linear Algebra Appl. 1 (1994) 179-210.
17. TU-decomposition, Numer. Linear Algebra Appl. 5 (1998) 483-509.
18. O. Nevanlinna, Convergence of Iterations for Linear Equations, Lectures in Mathematics, ETH Zürich (Birkhäuser, Basel, 1993).
19. Y. Notay, On the convergence rate of the conjugate gradients in presence of rounding errors, Numer. Math. 65 (1993) 301-317.
20. A. van der Sluis and H.A. van der Vorst, The rate of convergence of conjugate gradients, Numer. Math. 48 (1986) 543-560.
21. H.A. van der Vorst, The convergence behaviour of preconditioned CG and CG-S in the presence of rounding errors, in: Preconditioned Conjugate Gradient Methods, eds. O. Axelsson and L.Yu. Kolotilina, Lecture Notes in Mathematics, Vol. 1457 (Springer Berlin, 1989) pp. 126-136.
22. J. Xu, Iterative methods by space decomposition and subspace correction, SIAM Rev. 24 (1992) 581-613.