Automatic coarsening in Algebraic Multigrid utilizing quality measures for matching-based aggregations

Automatic coarsening in Algebraic Multigrid utilizing quality measures for matching-based aggregations
复制标题

利用质量测量进行基于匹配的聚合的代数多重网格中的自动粗化

DOI:
10.1016/j.camwa.2023.06.026
复制
发表时间:
2023
影响因子:
2.9
通讯作者:
Zikatanov, Ludmil
Zikatanov, Ludmil
中科院分区:
数学2区
文献类型:
--
作者:
D'Ambra, Pasqua;Durastante, Fabio;Filippone, Salvatore;Zikatanov, Ludmil

文献摘要

参考文献

相似文献

本文讨论了一般对称正定矩阵的代数多重网格法(AMG)的收敛问题。该方法依赖于一种基于相容加权匹配的聚集算法,该算法利用相容松弛原理和无向加权图中的最大乘积匹配之间的相互作用。这些结果基于一个一般的收敛分析理论,该理论适用于AMG方法类,该方法采用非光滑聚集并确定粗化的质量度量;类似的质量度量最初被引入并应用于其他方法以获得高质量的聚集,从而导致M-矩阵的最优收敛。分析以及粗化过程是纯代数的,在我们的情况下,允许对聚集过程的质量进行变位评估,我们应用该聚集过程来分析匹配计算和图边权重定义的近似算法的影响。我们还探索了集合体的选择与相容松弛收敛之间的关系,证实了纯代数多重网格法中粗化过程的设计理论与相容加权匹配粗化的有效性之间的一致性。我们讨论了各种完全自动的算法方法来获得集合体,这些集合体在各种测试用例上都获得了良好的收敛特性。
In this paper, we discuss the convergence of an Algebraic MultiGrid (AMG) method for general symmetric positive-definite matrices. The method relies on an aggregation algorithm, namedcoarsening based on compatible weighted matching, which exploits the interplay between the principle of compatible relaxation and the maximum product matching in undirected weighted graphs. The results are based on a general convergence analysis theory applied to the class of AMG methods employing unsmoothed aggregation and identifying a quality measure for the coarsening; similar quality measures were originally introduced and applied to other methods as tools to obtain good quality aggregates leading to optimal convergence for M-matrices. The analysis, as well as the coarsening procedure, is purely algebraic and, in our case, allows anaposteriorievaluation of the quality of the aggregation procedure which we apply to analyze the impact of approximate algorithms for matching computation and the definition of graph edge weights. We also explore the connection between the choice of the aggregates and the compatible relaxation convergence, confirming the consistency between theories for designing coarsening procedures in purely algebraic multigrid methods and the effectiveness of the coarsening based on compatible weighted matching. We discuss various completely automatic algorithmic approaches to obtain aggregates for which good convergence properties are achieved on various test cases.
DOI: --
发表时间: 1986
期刊:
影响因子: --
作者:
R. Blaheta
通讯作者: R. Blaheta
DOI: --
发表时间: 1991
期刊:
影响因子: --
作者:
I. Marek
通讯作者: I. Marek
DOI: 10.1007/s00791-014-0224-9
发表时间: 2013-04
影响因子: --
作者:
P. D'Ambra;P. Vassilevski
通讯作者: P. D'Ambra;P. Vassilevski
DOI: 10.1137/18m1194493
发表时间: 2018-06
期刊: SIAM J. Sci. Comput.
影响因子: --
作者:
Xiaozhe Hu;Junyuan Lin;L. Zikatanov
通讯作者: Xiaozhe Hu;Junyuan Lin;L. Zikatanov
图上的自适应聚合
DOI: 10.1016/j.cam.2017.10.032
发表时间: 2018
影响因子: 2.4
作者:
Xu, Wenfang;Zikatanov, Ludmil T.
通讯作者: Zikatanov, Ludmil T.