arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.09848math.NAcs.NA
收藏

并行 AMG 的最优多项式平滑器

Optimal Polynomial Smoothers for Parallel AMG

Pasqua D'Ambra, Fabio Durastante, Salvatore Filippone, Stefano Massei, Stephen Thomas

AI总结:

本文研究 AMG 预条件器中适用于并行计算的多项式平滑器,利用第一类和第四类 Chebyshev 多项式求解极小极大问题,并通过 GPU kernel 与大规模基准验证其有效性。

摘要:

本文探讨了非常适合并行计算的多项式加速器,特别是作为代数多重网格(Algebraic MultiGrid,AMG)预条件器中的平滑器。这些加速器求解一个极小极大问题;该问题最初由 [Lottes, Numer. Lin. Alg. with Appl. 30(6), 2518 (2023)] 提出,旨在在不需要矩阵谱信息的情况下,为 AMG V-cycle 误差界中一个依赖于多项式的常数获得最优(或接近最优)的界。Lottes 关注第四类 Chebyshev 多项式,并定义了适用于一般收敛性基础平滑器的相关递推公式。本文证明了这些加速方法在现代 GPU 加速超级计算机上的大规模应用中的有效性。此外,我们构造了上述极小极大问题的一种变体,它自然产生基于第一类 Chebyshev 多项式的解,作为基础平滑器的加速器。对于所有多项式加速方法,我们描述了用于应用它们的高效 GPU kernel,并在超大规模的标准基准测试上证明了它们相当的有效性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑