skip to main content

SciTech ConnectSciTech Connect

This content will become publicly available on October 29, 2016

Title: Algebraic multigrid domain and range decomposition (AMG-DD / AMG-RD)*

In modern large-scale supercomputing applications, algebraic multigrid (AMG) is a leading choice for solving matrix equations. However, the high cost of communication relative to that of computation is a concern for the scalability of traditional implementations of AMG on emerging architectures. This paper introduces two new algebraic multilevel algorithms, algebraic multigrid domain decomposition (AMG-DD) and algebraic multigrid range decomposition (AMG-RD), that replace traditional AMG V-cycles with a fully overlapping domain decomposition approach. While the methods introduced here are similar in spirit to the geometric methods developed by Brandt and Diskin [Multigrid solvers on decomposed domains, in Domain Decomposition Methods in Science and Engineering, Contemp. Math. 157, AMS, Providence, RI, 1994, pp. 135--155], Mitchell [Electron. Trans. Numer. Anal., 6 (1997), pp. 224--233], and Bank and Holst [SIAM J. Sci. Comput., 22 (2000), pp. 1411--1443], they differ primarily in that they are purely algebraic: AMG-RD and AMG-DD trade communication for computation by forming global composite “grids” based only on the matrix, not the geometry. (As is the usual AMG convention, “grids” here should be taken only in the algebraic sense, regardless of whether or not it corresponds to any geometry.) Another important distinguishing feature of AMG-RD and AMG-DD is their novel residualmore » communication process that enables effective parallel computation on composite grids, avoiding the all-to-all communication costs of the geometric methods. The main purpose of this paper is to study the potential of these two algebraic methods as possible alternatives to existing AMG approaches for future parallel machines. As a result, this paper develops some theoretical properties of these methods and reports on serial numerical tests of their convergence properties over a spectrum of problem parameters.« less
 [1] ;  [2] ;  [3] ;  [3] ;  [3] ;  [3]
  1. Univ. of California at San Diego, La Jolla, CA (United States)
  2. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
  3. Univ. of Colorado, Boulder, CO (United States)
Publication Date:
OSTI Identifier:
Report Number(s):
Journal ID: ISSN 1064-8275
Grant/Contract Number:
Accepted Manuscript
Journal Name:
SIAM Journal on Scientific Computing
Additional Journal Information:
Journal Volume: 37; Journal Issue: 5; Journal ID: ISSN 1064-8275
Research Org:
Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
Sponsoring Org:
Country of Publication:
United States
97 MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE iterative methods; multigrid; algebraic multigrid; parallel; scalability; domain decomposition