Adaptive AMG with Coarsening Based on Compatible Weighted Matching
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
We introduce a new composite adaptive Algebraic Multigrid (composite αAMG) method to solve systems of linear equations without a-priori knowledge or assumption on characteristics of near-null components of the AMG preconditioned problem referred to as algebraic smoothness. Our version of αAMG is a composite solver built through a bootstrap strategy aimed to obtain a desired convergence rate. The coarsening process employed to build each new solver component relies on a pairwise aggregation scheme based on maximum weighted matching in a graph and on principles of compatible relaxation. The latter replaces the commonly used characterization of strength of connection in both the coarse space selection and in the interpolation scheme. The goal is to design a method leading to scalable AMG for a wide class of problems that go beyond the standard elliptic Partial Differential Equations (PDEs). In the present work, we introduce the method and demonstrate its potential when applied to symmetric positive definite linear systems arising from finite element discretization of highly anisotropic elliptic PDEs on structured and unstructured meshes.
- Research Organization:
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 1062221
- Report Number(s):
- LLNL-TR--613612
- Country of Publication:
- United States
- Language:
- English
Similar Records
αAMG based on Weighted Matching for Systems of Elliptic PDEs Arising From Displacement and Mixed Methods
Improving solve time of aggregation-based adaptive AMG
Conference
·
Fri May 30 00:00:00 EDT 2014
·
OSTI ID:1144751
Improving solve time of aggregation-based adaptive AMG
Journal Article
·
Sat Oct 19 20:00:00 EDT 2019
· Numerical Linear Algebra with Applications
·
OSTI ID:1669235