Algebraic multigrid domain and range decomposition (AMGDD / AMGRD)*
Abstract
In modern largescale 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 (AMGDD) and algebraic multigrid range decomposition (AMGRD), that replace traditional AMG Vcycles 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. 135155], Mitchell [Electron. Trans. Numer. Anal., 6 (1997), pp. 224233], and Bank and Holst [SIAM J. Sci. Comput., 22 (2000), pp. 14111443], they differ primarily in that they are purely algebraic: AMGRD and AMGDD 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 AMGRD and AMGDD is their novel residualmore »
 Authors:

 Univ. of California at San Diego, La Jolla, CA (United States)
 Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
 Univ. of Colorado, Boulder, CO (United States)
 Publication Date:
 Research Org.:
 Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
 Sponsoring Org.:
 USDOE
 OSTI Identifier:
 1245718
 Report Number(s):
 LLNLJRNL666751
Journal ID: ISSN 10648275
 Grant/Contract Number:
 AC5207NA27344
 Resource Type:
 Accepted Manuscript
 Journal Name:
 SIAM Journal on Scientific Computing
 Additional Journal Information:
 Journal Volume: 37; Journal Issue: 5; Journal ID: ISSN 10648275
 Publisher:
 SIAM
 Country of Publication:
 United States
 Language:
 English
 Subject:
 97 MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; iterative methods; multigrid; algebraic multigrid; parallel; scalability; domain decomposition
Citation Formats
Bank, R., Falgout, R. D., Jones, T., Manteuffel, T. A., McCormick, S. F., and Ruge, J. W. Algebraic multigrid domain and range decomposition (AMGDD / AMGRD)*. United States: N. p., 2015.
Web. https://doi.org/10.1137/140974717.
Bank, R., Falgout, R. D., Jones, T., Manteuffel, T. A., McCormick, S. F., & Ruge, J. W. Algebraic multigrid domain and range decomposition (AMGDD / AMGRD)*. United States. https://doi.org/10.1137/140974717
Bank, R., Falgout, R. D., Jones, T., Manteuffel, T. A., McCormick, S. F., and Ruge, J. W. Thu .
"Algebraic multigrid domain and range decomposition (AMGDD / AMGRD)*". United States. https://doi.org/10.1137/140974717. https://www.osti.gov/servlets/purl/1245718.
@article{osti_1245718,
title = {Algebraic multigrid domain and range decomposition (AMGDD / AMGRD)*},
author = {Bank, R. and Falgout, R. D. and Jones, T. and Manteuffel, T. A. and McCormick, S. F. and Ruge, J. W.},
abstractNote = {In modern largescale 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 (AMGDD) and algebraic multigrid range decomposition (AMGRD), that replace traditional AMG Vcycles 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. 135155], Mitchell [Electron. Trans. Numer. Anal., 6 (1997), pp. 224233], and Bank and Holst [SIAM J. Sci. Comput., 22 (2000), pp. 14111443], they differ primarily in that they are purely algebraic: AMGRD and AMGDD 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 AMGRD and AMGDD is their novel residual communication process that enables effective parallel computation on composite grids, avoiding the alltoall 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.},
doi = {10.1137/140974717},
journal = {SIAM Journal on Scientific Computing},
number = 5,
volume = 37,
place = {United States},
year = {2015},
month = {10}
}
Web of Science
Works referenced in this record:
Some variants of the Bank–Holst parallel adaptive meshing paradigm
journal, August 2006
 Bank, Randolph E.
 Computing and Visualization in Science, Vol. 9, Issue 3
A New Paradigm for Parallel Adaptive Meshing Algorithms
journal, January 2000
 Bank, Randolph E.; Holst, Michael
 SIAM Journal on Scientific Computing, Vol. 22, Issue 4
A new parallel domain decomposition method for the adaptive finite element solution of elliptic partial differential equations
journal, January 2001
 Bank, Randolph E.; Jimack, Peter K.
 Concurrency and Computation: Practice and Experience, Vol. 13, Issue 5
A Domain Decomposition Solver for a Parallel Adaptive Meshing Paradigm
journal, January 2004
 Bank, Randolph E.; Lu, Shaoying
 SIAM Journal on Scientific Computing, Vol. 26, Issue 1
Convergence analysis of a domain decomposition paradigm
journal, April 2008
 Bank, Randolph E.; Vassilevski, Panayot S.
 Computing and Visualization in Science, Vol. 11, Issue 46
BoomerAMG: A parallel algebraic multigrid solver and preconditioner
journal, April 2002
 Henson, Van Emden; Yang, Ulrike Meier
 Applied Numerical Mathematics, Vol. 41, Issue 1
Parallel Adaptive Multilevel Methods with Full Domain Partitions
journal, March 2004
 Mitchell, William F.
 Applied Numerical Analysis & Computational Mathematics, Vol. 1, Issue 1
Coarse Spaces by Algebraic Multigrid: Multigrid Convergence and Upscaling Error Estimates
journal, April 2011
 Vassilevski, Panayot S.
 Advances in Adaptive Data Analysis, Vol. 03, Issue 01n02
Works referencing / citing this record:
Preparing sparse solvers for exascale computing
journal, January 2020
 Anzt, Hartwig; Boman, Erik; Falgout, Rob
 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 378, Issue 2166
Parallel Multiprojection Preconditioned Methods Based on Subspace Compression
journal, January 2017
 Moutafis, Byron E.; FilelisPapadopoulos, Christos K.; Gravvanis, George A.
 Mathematical Problems in Engineering, Vol. 2017