Skip to main content
Log in

A Multilevel AINV Preconditioner

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

In this paper we describe an algebraic multilevel extension of the approximate inverse AINV preconditioner for solving symmetric positive definite linear systems Ax=b with the preconditioned conjugate gradient method. The smoother is the approximate inverse M and the coarse grids and the interpolation operator are constructed by looking at the entries of M. Numerical examples are given for problems arising from discretization of partial differential equations.

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. M. Benzi, J. Cullum and M. Tuma, Robust approximate inverse preconditioning for the conjugate gradient method, SIAM J. Sci. Comput. 22 (2000) 1318–1332.

    Google Scholar 

  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.

    Google Scholar 

  3. V.E. Henson, An algebraic multigrid tutorial, MGNET, http://www.mgnet.org (1999).

  4. G. Meurant, Computer Solution of Large Linear Systems (North-Holland, Amsterdam, 1999).

    Google Scholar 

  5. G. Meurant, Numerical experiments with algebraic multilevel preconditioners, accepted in ETNA.

  6. J.W. Ruge and K. Stuben, Algebraic multigrid, in: Multigrid Methods, ed. S.F. Mc Cormick (SIAM, Philadelphia, PA, 1987) pp. 73–130.

    Google Scholar 

  7. C. Wagner, Introduction to Algebraic Multigrid, Course Notes, Version 1.1 (University of Heidelberg, 1998).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meurant, G. A Multilevel AINV Preconditioner. Numerical Algorithms 29, 107–129 (2002). https://doi.org/10.1023/A:1014816109110

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014816109110

Navigation