In this paper, we explore polynomial accelerators that are well-suited for parallel computations, specifically as smoothers in Algebraic MultiGrid (AMG) preconditioners. These accelerators address a minimax problem, initially formulated in [Lottes, Numer. Lin. Alg. with Appl. 30(6), 2518 (2023)], aiming to achieve an optimal (or near-optimal) bound for a polynomial-dependent constant involved in the AMG V-cycle error bound, without requiring information about the matrices' spectra. Lottes focuses on Chebyshev polynomials of the 4th-kind and defines the relevant recurrence formulas applicable to a general convergent basic smoother. In this paper, we demonstrate the efficacy of these accelerations for large-scale applications on modern GPU-accelerated supercomputers. Furthermore, we formulate a variant of the aforementioned minimax problem, which naturally leads to solutions relying on Chebyshev polynomials of the 1st-kind as accelerators for a basic smoother. For all the polynomial accelerations, we describe efficient GPU kernels for their application and demonstrate their comparable effectiveness on standard benchmarks at very large scales.
Parallel matching-based AMG preconditioners for elliptic equations discretized by IgA
National Research Council of Italy (CNR)(意大利国家研究委员会);Institute for Applied Computing “Mauro Picone” (IAC)(毛罗·皮切纳应用计算研究所);University of Pisa(比萨大学);University of Rome “Tor Vergata”(罗马托维尔加塔大学)
Parallel Energy-Minimization Prolongation for Algebraic Multigrid
Department ICEA, University of Padova(帕多瓦大学ICEA学院);Department of Mathematics and Statistics, University of New Mexico(新墨西哥大学数学与统计系);Siebel Center for Computer Science, University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校西贝尔计算机科学中心)
Nodal Coarsening and Approximate Ideal Interpolation for H(curl) in Algebraic Multigrid
The Pennsylvania State University(宾夕法尼亚州立大学);Lawrence Livermore National Laboratory(劳伦斯利弗莫尔国家实验室);Bergische Universität Wuppertal(伍珀塔尔大学);University of New Mexico(新墨西哥大学)
A comparative study of efficient multigrid solvers for high-order local discontinuous Galerkin methods: Poisson, elliptic interface, and multiphase Stokes problems
Robust Preconditioning for Space-Time Isogeometric Analysis of Parabolic Evolution Problems
Johannes Kepler University(约翰内斯·开普勒大学);Institute of Computational Mathematics, Johannes Kepler University(约翰内斯·开普勒大学计算数学研究所);Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences(奥地利科学院约翰·拉顿计算与应用数学研究所)
A parallel Newton multigrid framework for monolithic fluid-structure interactions
Technische Universität München(慕尼黑工业大学);Otto-von-Guericke Universität Magdeburg(奥托·冯·古里克马格德堡大学);Interdisciplinary Center for Scientific Computing, Heidelberg University(海德堡大学跨学科科学计算中心)