CONSTRAINED LOCAL APPROXIMATE IDEAL RESTRICTION FOR ADVECTION-DIFFUSION PROBLEMS

被引:1
|
作者
Ali, Ahsan [1 ]
Brannick, James J. [2 ]
Kahl, Karsten [3 ]
Krzysik, Oliver A. [4 ]
Schroder, Jacob B. [1 ]
Southworth, Ben S. [5 ]
机构
[1] Univ New Mexico, Dept Math & Stat, Albuquerque, NM 87131 USA
[2] Penn State Univ, Dept Math, University Pk, PA 16802 USA
[3] Berg Univ Wuppertal, Sch Math & Nat Sci, D-42119 Wuppertal, Germany
[4] Univ Waterloo, Dept Appl Math, Waterloo, ON N2L 3G1, Canada
[5] Los Alamos Natl Lab, Los Alamos, NM 87545 USA
来源
SIAM JOURNAL ON SCIENTIFIC COMPUTING | 2024年 / 46卷 / 05期
基金
美国国家科学基金会;
关键词
algebraic multigrid; multigrid reduction; root-node; energy minimization; nonsymmetric; preconditioning; SMOOTHED AGGREGATION; DISCONTINUOUS GALERKIN; MULTIGRID REDUCTION; TIME; CONVERGENCE; INTERPOLATION;
D O I
10.1137/23M1583442
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper focuses on developing a reduction-based algebraic multigrid (AMG) method that is suitable for solving general (non)symmetric linear systems and is naturally robust from pure advection to pure diffusion. Initial motivation comes from a new reduction-based AMG approach, LAIR (local approximate ideal restriction), that was developed for solving advectiondominated problems. Though this new solver is very effective in the advection-dominated regime, its performance degrades in cases where diffusion becomes dominant. This is consistent with the fact that in general, reduction-based AMG methods tend to suffer from growth in complexity and/or convergence rates as the problem size is increased, especially for diffusion-dominated problems in two or three dimensions. Motivated by the success of LAIR in the advective regime, our aim in this paper is to generalize the AIR framework with the goal of improving the performance of the solver in diffusion-dominated regimes. To do so, we propose a novel way to combine mode constraints as used commonly in energy-minimization AMG methods with the local approximation of ideal operators used in LAIR. The resulting constrained LAIR algorithm is able to achieve fast scalable convergence on advective and diffusive problems. In addition, it is able to achieve standard low complexity hierarchies in the diffusive regime through aggressive coarsening, something that was previously difficult for reduction-based methods.
引用
收藏
页码:S96 / S122
页数:27
相关论文
共 50 条