Parallel Multigrid Preconditioning of the Conjugate Gradient Method for Systems of Subsurface Hydrology
โ Scribed by Leesa Brieger; Giuditta Lecca
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 186 KB
- Volume
- 142
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
โฆ Synopsis
Parallel preconditioners are considered for improving the convergence rate of the conjugate gradient method for solving sparse symmetric positive definite systems generated by finite element models of subsurface flow. The difficulties of adapting effective sequential preconditioners to the parallel environment are illustrated by our treatment of incomplete Cholesky preconditioning. These difficulties are avoided with multigrid preconditioning, which can be extended naturally to many processors so that the preconditioner remains global and effective.The coarse grid correction which defines the multigrid preconditioner is outlined and its parallel implementation with the distributed finite element data structure is presented, along with some examples of its use as a parallel preconditioner.
๐ SIMILAR VOLUMES
## Abstract In this Letter, both the banded diagonal matrix and the symmetric successive overrelaxation (SSOR) precondition CG techniques are applied to dense matrix equations from the mixed potential integral equation (MPIE) to enhance computational efficiency. Numerical calculations show that the
A method capable of solving very fast and robust complex non-linear systems of equations is presented. The block adaptive multigrid @AM) method combines mesh adaptive techniques w i t h multigrid and domain decomposition methods. The overall method is based on the FAS multigrid, but instead of using
The algebraic multigrid method (AMG) can be applied as a preconditioner for the conjugate gradient method. Since no special hierarchical mesh structure has to be specified, this method is very well suited for the implementation into a standard finite element program. A general concept for the parall
Recently an efficient method (DACG) for the partial solution of the symmetric generalized eigenproblem Ax = ฮปBx has been developed, based on the conjugate gradient (CG) minimization of the Rayleigh quotient over successive deflated subspaces of decreasing size. The present paper provides a numerical