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

面向极端规模线性求解器的AMG预处理器

AMG preconditioners for Linear Solvers towards Extreme Scale

Pasqua D'Ambra, Fabio Durastante, Salvatore Filippone

摘要:

大型稀疏系统的线性求解器是科学应用的关键要素,其有效实现对于利用当前计算机的计算能力是必要的。代数多重网格(AMG)预条件是一个流行的成分,这样的线性求解器,这是本工作的动机,我们研究了一些最近的发展,在一个包的AMG预条件,以提高效率,可扩展性和鲁棒性的极端规模的问题。主要的新颖性是设计和实施的并行粗化算法的基础上聚合的未知数采用加权图匹配技术,这是一个完全自动化的过程,不需要从用户的信息,并适用于一般的对称正定(s.p.d.)矩阵新的粗化算法在数值可扩展性方面有所改进,运算符复杂度较低,优于以前版本中的解耦聚合算法。预处理器包构建在并行软件框架\texttt{PSBLAS}上,该框架也已更新,以向exascale迈进。我们目前弱的可扩展性结果在欧洲最强大的超级计算机之一,线性系的大小高达$O(10^{10})$未知数。

英文摘要:

Linear solvers for large and sparse systems are a key element of scientific applications, and their efficient implementation is necessary to harness the computational power of current computers. Algebraic MultiGrid (AMG) preconditioners are a popular ingredient of such linear solvers; this is the motivation for the present work where we examine some recent developments in a package of AMG preconditioners to improve efficiency, scalability, and robustness on extreme-scale problems. The main novelty is the design and implementation of a parallel coarsening algorithm based on aggregation of unknowns employing weighted graph matching techniques; this is a completely automated procedure, requiring no information from the user, and applicable to general symmetric positive definite (s.p.d.) matrices. The new coarsening algorithm improves in terms of numerical scalability at low operator complexity over decoupled aggregation algorithms available in previous releases of the package. The preconditioners package is built on the parallel software framework \texttt{PSBLAS}, which has also been updated to progress towards exascale. We present weak scalability results on one of the most powerful supercomputers in Europe, for linear systems with sizes up to $O(10^{10})$ unknowns.

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

↑