Compatible Relaxation and Coarsening in Algebraic Multigrid
Journal Article
·
· SIAM Journal on Scientific Computing
OSTI ID:985488
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. Lastly, we introduce a variant of CR that provides a sharper metric of coarse-grid quality and demonstrate its potential with two simple examples.
- Research Organization:
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 985488
- Report Number(s):
- LLNL-JRNL-417122
- Journal Information:
- SIAM Journal on Scientific Computing, Journal Name: SIAM Journal on Scientific Computing Journal Issue: 3 Vol. 32; ISSN 1064-8275; ISSN SJOCE3
- Country of Publication:
- United States
- Language:
- English
Similar Records
On Compatible Transfer Operators in Nonsymmetric Algebraic Multigrid
Distance-Two Interpolation for Parallel Algebraic Multigrid
Coarse-grid selection for parallel algebraic multigrid
Journal Article
·
Mon Jul 01 00:00:00 EDT 2024
· SIAM Journal on Matrix Analysis and Applications
·
OSTI ID:2433953
Distance-Two Interpolation for Parallel Algebraic Multigrid
Journal Article
·
Tue May 08 00:00:00 EDT 2007
· Numerical Linear Algebra with Applications, vol. 15, no. 2-3, December 3, 2007, pp. 115-139
·
OSTI ID:940875
Coarse-grid selection for parallel algebraic multigrid
Conference
·
Mon Jun 01 00:00:00 EDT 1998
·
OSTI ID:293405