Journal
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS
Volume 14, Issue 8, Pages 611-643Publisher
WILEY
DOI: 10.1002/nla.541
Keywords
algebraic multigrid; coarsening; parallel computing
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available