Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Non-Galerkin Coarse Grids for Algebraic Multigrid

Journal Article · · SIAM Journal on Scientific Computing
DOI:https://doi.org/10.1137/130931539· OSTI ID:1237540
 [1];  [1]
  1. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

Algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. And while AMG has been effectively implemented on large scale parallel machines, challenges remain, especially when moving to exascale. Particularly, stencil sizes (the number of nonzeros in a row) tend to increase further down in the coarse grid hierarchy, and this growth leads to more communication. Therefore, as problem size increases and the number of levels in the hierarchy grows, the overall efficiency of the parallel AMG method decreases, sometimes dramatically. This growth in stencil size is due to the standard Galerkin coarse grid operator, $P^T A P$, where $$P$$ is the prolongation (i.e., interpolation) operator. For example, the coarse grid stencil size for a simple three-dimensional (3D) seven-point finite differencing approximation to diffusion can increase into the thousands on present day machines, causing an associated increase in communication costs. We therefore consider algebraically truncating coarse grid stencils to obtain a non-Galerkin coarse grid. First, the sparsity pattern of the non-Galerkin coarse grid is determined by employing a heuristic minimal “safe” pattern together with strength-of-connection ideas. Second, the nonzero entries are determined by collapsing the stencils in the Galerkin operator using traditional AMG techniques. The result is a reduction in coarse grid stencil size, overall operator complexity, and parallel AMG solve phase times.

Research Organization:
Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Sponsoring Organization:
USDOE
DOE Contract Number:
AC52-07NA27344
OSTI ID:
1237540
Report Number(s):
LLNL-JRNL--641635
Journal Information:
SIAM Journal on Scientific Computing, Journal Name: SIAM Journal on Scientific Computing Journal Issue: 3 Vol. 36; ISSN 1064-8275
Publisher:
SIAM
Country of Publication:
United States
Language:
English

References (10)

A General Interpolation Strategy for Algebraic Multigrid Using Energy Minimization journal January 2011
Distance-two interpolation for parallel algebraic multigrid journal January 2008
Collocation Coarse Approximation in Multigrid journal January 2009
Convergence Analysis of Perturbed Two‐Grid and Multigrid Methods journal January 2007
Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems journal September 1996
The Multi-Grid Method for the Diffusion Equation with Strongly Discontinuous Coefficients journal December 1981
Reducing Complexity in Parallel Algebraic Multigrid Preconditioners journal January 2006
Multigrid Smoothers for Ultraparallel Computing journal January 2011
BoomerAMG: A parallel algebraic multigrid solver and preconditioner journal April 2002
A Parallel Multigrid Preconditioned Conjugate Gradient Algorithm for Groundwater Flow Simulations journal September 1996

Similar Records

Reducing Parallel Communication in Algebraic Multigrid through Sparsification
Journal Article · Thu Dec 31 23:00:00 EST 2015 · SIAM Journal on Scientific Computing · OSTI ID:1808755

Coarse-grid selection for parallel algebraic multigrid
Conference · Mon Jun 01 00:00:00 EDT 1998 · OSTI ID:293405

Reducing Operator Complexity of Galerkin Coarse-grid Operators with Machine Learning
Journal Article · Fri Sep 06 00:00:00 EDT 2024 · SIAM Journal on Scientific Computing · OSTI ID:2504058