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 Lab. (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 985488
- Report Number(s):
- LLNL-JRNL-417122; SJOCE3; TRN: US201016%%2023
- Journal Information:
- SIAM Journal on Scientific Computing, Vol. 32, Issue 3; ISSN 1064-8275
- Country of Publication:
- United States
- Language:
- English
Similar Records
Algebraic coarsening methods for linear and nonlinear PDE and systems
Distance-Two Interpolation for Parallel Algebraic Multigrid
Experiences with BoomerAMG:: A Parallel Algebraic Multigrid Solver and Preconditioner for Large Linear Systems
Technical Report
·
Mon Nov 06 00:00:00 EST 2000
·
OSTI ID:985488
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:985488
+1 more
Experiences with BoomerAMG:: A Parallel Algebraic Multigrid Solver and Preconditioner for Large Linear Systems
Conference
·
Tue Feb 22 00:00:00 EST 2000
·
OSTI ID:985488