Skip to main content
Log in

On the rate of convergence of the preconditioned conjugate gradient method

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

We derive new estimates for the rate of convergence of the conjugate gradient method by utilizing isolated eigenvalues of parts of the spectrum. We present a new generalized version of an incomplete factorization method and compare the derived estimates of the number of iterations with the number actually found for some elliptic difference equations and for a similar problem with a model empirical distribution function.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Andersson, L.: SSOR preconditioning of Toeplitz matrices. Thesis, Chalmers University of Technology, Göteborg, Sweden, 1976

    Google Scholar 

  2. Axelsson, O.: A class of iterative methods for finite element equations. Comput. Methods Appl. Mech. Eng.9, 123–137 (1976)

    Google Scholar 

  3. Axelsson, O.: A general incomplete block-matrix factorization method. Linear Algebra Appl. (to appear)

  4. Axelsson, O., Brinkkemper, S., Il'in, V.P.: On some versions of incomplete block-matrix factorization iterative methods. Linear Algebra Appl.58, 3–15 (1984)

    Google Scholar 

  5. Axelsson, O., Lindskog, G.: On the eigenvalue distribution of a class of preconditioning methods. Report 3, Numerical Analysis Group, Department, of Computer Sciences, Chalmers University of Technology Göteborg, Sweden 1985

    Google Scholar 

  6. Greenbaum, A.: Comparison of splittings used with the conjugate gradient algorithm. Numer. Math.33, 181–194 (1979)

    Google Scholar 

  7. Gustafsson, I.: Modified Incomplete Cholesky (MIC) Methods. In: Preconditioning Methods, Theory and Applications (Evans, D.J., ed.), pp. 265–293. New York: Gordon and Breach Science Publishers 1983

    Google Scholar 

  8. Jennings, A.: Influence of the Eigenvalue Spectrum on the Convergence Rate of the Conjugate Gradient Method. JIMA20, 61–72 (1977)

    Google Scholar 

  9. Kaniel, S.: Estimates for some computational techniques in linear algebra. Math. Comput.20, 369–378 (1966)

    Google Scholar 

  10. Kershaw, D.: The incomplete Cholesky conjugate gradient method for the iterative solution of systems of linear equations. J. Comput. Phys.26, 43–65 (1978)

    Google Scholar 

  11. Saff, E.B., Varga, R.S.: On incomplete polynomials. In: Numerische Methoden der Approximationstheorie, Band 4. (L. Collatz, G. Meinardus, H. Werner, eds.), pp. 281–298. ISNM 42, Basel: Birkhäuser Verlag 1978

    Google Scholar 

  12. Szegö, G.: Orthogonal Polynomials. Americal Mathematical Society Colloquium Publications Volume XXIII American Mathematical Society, Providence, Rhode Island, 1939

  13. van der Vorst, H.A., van der Sluis, A.: The rate of convergence of conjugate gradients. Preprint Nr. 354, Department of Mathematics, University of Utrecht, 1984

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Axelsson, O., Lindskog, G. On the rate of convergence of the preconditioned conjugate gradient method. Numer. Math. 48, 499–523 (1986). https://doi.org/10.1007/BF01389448

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01389448

Subject Classifications

Navigation