Journal
SIAM JOURNAL ON SCIENTIFIC COMPUTING
Volume 32, Issue 3, Pages 1393-1416Publisher
SIAM PUBLICATIONS
DOI: 10.1137/090772216
Keywords
algebraic multigrid; compatible relaxation
Categories
Funding
- National Science Foundation [OCI-0749202, DMS-810982]
- DOE [B574151, B574163]
- U.S. Department of Energy by Lawrence Livermore National Laboratory [DE-AC52-07NA27344]
Ask authors/readers for more resources
We introduce a coarsening algorithm for algebraic multigrid (AMG) based on the concept of compatible relaxation (CR). The algorithm is significantly different from standard methods, most notably because it does not rely on any notion of strength of connection. We study its behavior on a number of model problems and evaluate the performance of an AMG algorithm that incorporates the coarsening approach. Finally, we introduce a variant of CR that provides a sharper metric of coarse-grid quality and demonstrate its potential with two simple examples.
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