期刊
SIAM JOURNAL ON SCIENTIFIC COMPUTING
卷 32, 期 3, 页码 1393-1416出版社
SIAM PUBLICATIONS
DOI: 10.1137/090772216
关键词
algebraic multigrid; compatible relaxation
资金
- National Science Foundation [OCI-0749202, DMS-810982]
- DOE [B574151, B574163]
- U.S. Department of Energy by Lawrence Livermore National Laboratory [DE-AC52-07NA27344]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据