返回
AN EFFICIENT MULTIGRID METHOD FOR GRAPH LAPLACIAN SYSTEMS II: ROBUST AGGREGATION
DOI:10.1137/16M1071420.png)
摘要
En 中文
We consider the iterative solution of linear systems whose matrices are Laplacians of undirected graphs. Designing robust solvers for this class of problems is challenging due to the diversity of connectivity patterns encountered in practical applications. Our starting point is a recently proposed aggregation-based algebraic multigrid method that combines the recursive static elimination of the vertices of degree 1 with the degree-aware rooted aggregation (DRA) algorithm. The latter always produces aggregates big enough to ensure that the preconditioner cost per iteration is low. Here we further improve the robustness of the method by controlling the quality of the aggregates. More precisely, bad vertices are removed from the aggregates formed by the DRA algorithm until a quality test is passed. This ensures that the two-grid condition number is nicely bounded, whereas the cost per iteration is kept low by reforming too small aggregates when it happens that the mean aggregate size is not large enough. The effectiveness and the robustness of the resulting method are assessed on a large set of undirected graphs by comparing with the variant without quality control, as well as with another state-of-the art graph Laplacian solver.
Keyword:
multigrid
algebraic multigrid
graph Laplacian
preconditioning
aggregation
convergence analysis
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Niobium‐ and Tantalum‐Doped Pt‐Sn/Al2O3 as Efficient Catalysts for Propane Dehydrogenation
ChemPlusChem
IF0
Effect of reversible fluxoid motion in superconducting Bi-2223 multifilamentary wire可逆磁通量子运动对超导Bi-2223多芯复合导线的影响

