On the parallelization of multi-grid methods using a non-overlapping domain decomposition data structure
- 28 February 1997
- journal article
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 23 (1) , 119-137
- https://doi.org/10.1016/s0168-9274(96)00064-5
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- The analysis of smoothers for multigrid algorithmsMathematics of Computation, 1992
- Parallelization of Robust Multigrid Methods: ILU Factorization and Frequency Decomposition MethodSIAM Journal on Scientific and Statistical Computing, 1991
- Convergence estimates for multigrid algorithms without regularity assumptionsMathematics of Computation, 1991
- Concepts for efficient multigrid implementation on SUPRENUM-like architecturesParallel Computing, 1991
- Parallel multilevel preconditionersMathematics of Computation, 1990
- 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
- Sharp Estimates for Multigrid Rates of Convergence with General Smoothing and AccelerationSIAM Journal on Numerical Analysis, 1985
- A New Convergence Proof for the Multigrid Method Including the V-CycleSIAM Journal on Numerical Analysis, 1983