Parallel Smoothed Aggregation Multigrid: Aggregation Strategies on Massively Parallel Machines
Algebraic multigrid methods offer the hope that multigrid convergence can be achieved (for at least some important applications) without a great deal of effort from engineers and scientists wishing to solve linear systems. In this paper the authors consider parallelization of the smoothed aggregation multi-grid method. Smoothed aggregation is one of the most promising algebraic multigrid methods. Therefore, developing parallel variants with both good convergence and efficiency properties is of great importance. However, parallelization is nontrivial due to the somewhat sequential aggregation (or grid coarsening) phase. In this paper, they discuss three different parallel aggregation algorithms and illustrate the advantages and disadvantages of each variant in terms of parallelism and convergence. Numerical results will be shown on the Intel Teraflop computer for some large problems coming from nontrivial codes: quasi-static electric potential simulation and a fluid flow calculation.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sandia National Lab. (SNL-CA), Livermore, CA (United States)
- Sponsoring Organization:
- US Department of Energy (US)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 759470
- Report Number(s):
- SAND2000-8832C; TRN: AH200031%%110
- Resource Relation:
- Conference: Super Computing 2000, Dallas, TX (US), 11/09/2000--11/11/2000; Other Information: PBD: 9 Nov 2000
- Country of Publication:
- United States
- Language:
- English
Similar Records
Experiences with BoomerAMG:: A Parallel Algebraic Multigrid Solver and Preconditioner for Large Linear Systems
An improved convergence analysis of smoothed aggregation algebraic multigrid