Parallel Multilevel Preconditioners
Open Access
- 1 July 1990
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 55 (191) , 1-22
- https://doi.org/10.2307/2008789
Abstract
In this paper, we provide techniques for the development and analysis of parallel multilevel preconditioners for the discrete systems which arise in numerical approximation of symmetric elliptic boundary value problems. These preconditioners are defined as a sum of independent operators on a sequence of nested subspaces of the full approximation space. On a parallel computer, the evaluation of these operators and hence of the preconditioner on a given function can be computed concurrently.Keywords
This publication has 13 references indexed in Scilit:
- The Analysis of Multigrid Algorithms with Nonnested Spaces or Noninherited Quadratic FormsMathematics of Computation, 1991
- The Construction of Preconditioners for Elliptic Problems by Substructuring, IVMathematics of Computation, 1989
- The Construction of Preconditioners for Elliptic Problems by Substructuring, IIIMathematics of Computation, 1988
- New Convergence Estimates for Multigrid AlgorithmsMathematics of Computation, 1987
- The Construction of Preconditioners for Elliptic Problems by Substructuring. IIMathematics of Computation, 1987
- The Construction of Preconditioners for Elliptic Problems by Substructuring. IMathematics of Computation, 1986
- Multigrid Methods for Variational Problems: General Theory for the V-CycleSIAM Journal on Numerical Analysis, 1985
- Block Preconditioning for the Conjugate Gradient MethodSIAM Journal on Scientific and Statistical Computing, 1985
- Multigrid Methods for Variational Problems: Further ResultsSIAM Journal on Numerical Analysis, 1984
- An Optimal Order Process for Solving Finite Element EquationsMathematics of Computation, 1981