Abstract
Algebraic multigrid (AMG) is a powerful linear solver with attractive parallel properties. A parallel AMG method depends on efficient, parallel implementations of the coarse-grid selection algorithms and the restriction and prolongation operator construction algorithms. In the effort to effectively and quickly select the coarse grid, a number of parallel coarsening algorithms have been developed. This paper examines the behaviour of these algorithms in depth by studying the results of several numerical experiments. In addition, new parallel coarse-grid selection algorithms are introduced and tested.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 611-643 |
| Number of pages | 33 |
| Journal | Numerical Linear Algebra with Applications |
| Volume | 14 |
| Issue number | 8 |
| DOIs | |
| State | Published - Oct 1 2007 |
Keywords
- Algebraic multigrid
- Coarsening
- Parallel computing
ASJC Scopus subject areas
- Algebra and Number Theory
- Applied Mathematics
Fingerprint Dive into the research topics of 'Parallel coarse-grid selection'. Together they form a unique fingerprint.
Cite this
Alber, D. M., & Olson, L. N. (2007). Parallel coarse-grid selection. Numerical Linear Algebra with Applications, 14(8), 611-643. https://doi.org/10.1002/nla.541