Old and new convergence proofs for multigrid methods
- 1 January 1993
- journal article
- research article
- Published by Cambridge University Press (CUP) in Acta Numerica
- Vol. 2, 285-326
- https://doi.org/10.1017/s0962492900002385
Abstract
Multigrid methods are the fastest known methods for the solution of the large systems of equations arising from the discretization of partial differential equations. For self-adjoint and coercive linear elliptic boundary value problems (with Laplace's equation and the equations of linear elasticity as two typical examples), the convergence theory reached a mature, if not its final state. The present article reviews old and new developments for this type of equation and describes the recent advances.Keywords
This publication has 54 references indexed in Scilit:
- A basic norm equivalence for the theory of multilevel methodsNumerische Mathematik, 1993
- Multilevel Schwarz methodsNumerische Mathematik, 1992
- Multilevel preconditioningNumerische Mathematik, 1992
- On the spectra of sums of orthogonal projections with applications to parallel computingBIT Numerical Mathematics, 1991
- Two preconditioners based on the multi-level splitting of finite element spacesNumerische Mathematik, 1990
- Preconditioning indefinite discretization matricesNumerische Mathematik, 1989
- Linear iterations as smoothers in multigrid methods: Theory with applications to incomplete decompositionsIMPACT of Computing in Science and Engineering, 1989
- Concepts of an adaptive hierarchical finite element codeIMPACT of Computing in Science and Engineering, 1989
- A preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problemsMathematics of Computation, 1988
- On the multi-level splitting of finite element spacesNumerische Mathematik, 1986