Name
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. Copyright (c) 2007 John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1002/nla.541 | NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS |
Keywords | Field | DocType |
algebraic multigrid,coarsening,parallel computing | Analysis of parallel algorithms,Mathematical optimization,Computational science,Operator (computer programming),Linear solver,Mathematics,Multigrid method,Grid,Cost efficiency | Journal |
Volume | Issue | ISSN |
14 | 8 | 1070-5325 |
Citations | PageRank | References |
5 | 0.56 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| David M. Alber | 1 | 32 | 2.58 |
| Luke Olson | 2 | 235 | 21.93 |