Scalable algebraic multigrid on 3500 processors
Electronic transactions on numerical analysis, Tome 23 (2006), pp. 105-128
A parallel algebraic multigrid linear solver method is presented which is scalable to thousands of processors on significant classes of twoand three-dimensional problems. The algorithm is entirely algebraic and does not require prior information on the physical problem. Scalability is achieved through the use of an innovative parallel coarsening technique in addition to aggressive coarsening and multipass interpolation techniques. Details of this algorithm are presented together with numerical results on up to several thousand processors.
Classification :
65F10
Keywords: algebraic multigrid, AMG, parallel computing, simulations, scalable, linear solvers, parallel coarsening
Keywords: algebraic multigrid, AMG, parallel computing, simulations, scalable, linear solvers, parallel coarsening
@article{ETNA_2006__23__a12,
author = {Joubert, Wayne and Cullum, Jane},
title = {Scalable algebraic multigrid on 3500 processors},
journal = {Electronic transactions on numerical analysis},
pages = {105--128},
year = {2006},
volume = {23},
zbl = {1112.65027},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ETNA_2006__23__a12/}
}
Joubert, Wayne; Cullum, Jane. Scalable algebraic multigrid on 3500 processors. Electronic transactions on numerical analysis, Tome 23 (2006), pp. 105-128. http://geodesic.mathdoc.fr/item/ETNA_2006__23__a12/