Improving solve time of aggregation-based adaptive AMG
- National Research Council (CNR), Naples (Italy). Inst. for Applied Computing
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). Center for Applied Scientific Computing; Portland State Univ., OR (United States). Dept. of Mathematics and Statistics
In this paper, we propose improving the solve time of a bootstrap algebraic multigrid (AMG) designed previously by the authors. This is achieved by incorporating the information, a set of algebraically smooth vectors, generated by the bootstrap algorithm, in a single hierarchy by using sufficiently large aggregates, and these aggregates are compositions of aggregates already built throughout the bootstrap algorithm. The modified AMG method has good convergence properties and shows significant reduction in both memory and solve time. These savings with respect to the original bootstrap AMG are illustrated on some difficult (for standard AMG) linear systems arising from discretization of scalar and vector function elliptic partial differential equations in both 2D and 3D.
- Research Organization:
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA); European Union (EU); National Science Foundation (NSF)
- Grant/Contract Number:
- AC52-07NA27344; 824158; DMS-1619640
- OSTI ID:
- 1669235
- Alternate ID(s):
- OSTI ID: 1571299
- Report Number(s):
- LLNL-JRNL-776759; 968776
- Journal Information:
- Numerical Linear Algebra with Applications, Vol. 26, Issue 6; ISSN 1070-5325
- Publisher:
- WileyCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Web of Science
Similar Records
Adaptive Algebraic Multigrid for Finite Element Elliptic Equations with Random Coefficients
BootCMatch: A Software Package for Bootstrap AMG Based on GraphWeighted Matching