Paper Info
Title
Parallel smoothed aggregation multigrid: aggregation strategies on massively parallel machines
Abstract
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 we consider parallelization of the smoothed aggregation multigrid 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 greatimportance. However, parallelization is nontrivial due to the somewhat sequential aggregation (or grid coarsening) phase. In this paper, we 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.
Year
DOI
Venue
2000
10.1109/SC.2000.10008
SC
Keywords
DocType
ISBN
algebraic multigrid method,aggregation multigrid method,multigrid convergence,parallel variant,aggregation strategy,sequential aggregation,smoothed aggregation,parallel machine,different parallel aggregation algorithm,nontrivial code,good convergence,promising algebraic multigrid method,algorithms,convergence,linear system,computational modeling,linear systems,efficiency,algebraic multigrid,multigrid method,parallel processing,electric potential,fluid flow
Conference
0-7803-9802-5
Citations 
PageRank 
References 
36
2.81
2
Authors
1
Name
Order
Citations
PageRank
Ray S. Tuminaro144738.09