提升在拉伸网格应用中平滑聚合AMG的鲁棒性
Improving Smoothed Aggregation AMG Robustness on Stretched Mesh Applications
AI总结:
本文提出改进平滑聚合AMG在拉伸网格应用中鲁棒性的方法,通过改进连接强度矩阵、非对称缩放和分类标准,提升收敛性。
摘要:
连接强度算法在代数多重网格(AMG)中起关键作用。具体而言,它们确定哪些矩阵非零元素被分类为弱元素并被忽略在粗化矩阵图和定义插值稀疏模式时。总体目标是鼓励仅在误差可平滑的方向上粗化,并避免在问题变化剧烈的方向上粗化。不幸的是,开发鲁棒且经济的连接强度方案具有挑战性。矩阵非零元素的分类涉及四个方面:(a)选择连接强度矩阵,(b)缩放其值,(c)选择将缩放后的值分类为强或弱的标准,以及(d)删除弱项,这包括调整矩阵值以考虑删除的项。通常,平滑聚合AMG使用正在解决的线性系统作为连接强度矩阵。它对值进行对称缩放,使用矩阵对角线的平方根。它根据缩放后的值是否高于或低于阈值进行分类。最后,它通过修改对角线来调整矩阵值,使得删除矩阵中每行的总和与原始矩阵相同。虽然这些程序可以工作良好,但本文展示了失败案例,从而推动了替代方案。第一种替代方案使用距离拉普拉斯连接强度矩阵。第二种方案集中在非对称缩放上。然后,我们研究了基于识别缩放后的值间隙的替代分类标准。最后,提出了一种替代汇总过程,其中行和通过修改所有保留的矩阵项(而不是仅对角线项)来保持。一系列数值结果展示了权衡,证明在某些情况下,对于来自线性有限元的拉伸网格矩阵,明显更鲁棒的收敛性。
英文摘要:
Strength-of-connection algorithms play a key role in algebraic multigrid (AMG). Specifically, they determine which matrix nonzeros are classified as weak and so ignored when coarsening matrix graphs and defining interpolation sparsity patterns. The general goal is to encourage coarsening only in directions where error can be smoothed and to avoid coarsening across sharp problem variations. Unfortunately, developing robust and inexpensive strength-of-connection schemes is challenging. The classification of matrix nonzeros involves four aspects: (a) choosing a strength-of-connection matrix, (b) scaling its values, (c) choosing a criterion to classify scaled values as strong or weak, and (d) dropping weak entries which includes adjusting matrix values to account for dropped terms. Typically, smoothed aggregation AMG uses the linear system being solved as a strength-of-connection matrix. It scales values symmetrically using square-roots of the matrix diagonal. It classifies based on whether scaled values are above or below a threshold. Finally, it adjusts matrix values by modifying the diagonal so that the sum of entries within each row of the dropped matrix matches that of the original. While these procedures can work well, we illustrate failure cases that motivate alternatives. The first alternative uses a distance Laplacian strength-of-connection matrix. The second centers on non-symmetric scaling. We then investigate alternative classification criteria based on identifying gaps in the values of the scaled entries. Finally, an alternative lumping procedure is proposed where row sums are preserved by modifying all retained matrix entries (as opposed to just diagonal entries). A series of numerical results illustrates trade-offs demonstrating in some cases notably more robust convergence on matrices coming from linear finite elements on stretched meshes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。