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

复杂和渐变网格上的二维和三维非结构化几何多重网格

Unstructured Geometric Multigrid in Two and Three Dimensions on Complex and Graded Meshes

University of Chicago(芝加哥大学)

Peter R. Brune, Matthew G. Knepley, L. Ridgway Scott

AI总结:

针对复杂形状或自适应细化网格上的有限元问题,提出一种基于拓扑的网格粗化算法简化版,用于构建非结构化几何多重网格的层次结构,并通过病态测试案例验证其性能。

摘要:

多重网格及相关预条件子与有限元方法结合使用时,通常受限于算法有效应用于问题的难度,尤其是当区域具有复杂形状或自适应细化时。我们引入了一种通用的基于拓扑的网格粗化算法的简化版,用于为几何非结构化多重网格方法创建网格层次结构。指出了该技术的保证与非准均匀问题的多重网格方法所需的质量标准之间的联系。讨论了实现细节,特别是与粗化、重新网格化和插值相关的细节。对自适应有限元方法中的病态测试案例的计算测试显示了该技术的性能。

英文摘要:

The use of multigrid and related preconditioners with the finite element method is often limited by the difficulty of applying the algorithm effectively to a problem, especially when the domain has a complex shape or adaptive refinement. We introduce a simplification of a general topologically-motivated mesh coarsening algorithm for use in creating hierarchies of meshes for geometric unstructured multigrid methods. The connections between the guarantees of this technique and the quality criteria necessary for multigrid methods for non-quasi-uniform problems are noted. The implementation details, in particular those related to coarsening, remeshing, and interpolation, are discussed. Computational tests on pathological test cases from adaptive finite element methods show the performance of the technique.

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

↑