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

三维非匹配与重叠网格上有限元方法的高效实现

Efficient implementation of finite element methods on non-matching and overlapping meshes in 3D

André Massing, Mats G. Larson, Anders Logg

AI总结:

针对三维非匹配/重叠网格上的有限元方法,提出一种自动检测网格交集并在切割单元和子单纯形上进行积分的通用算法,以Nitsche方法为例验证了泊松方程和线弹性问题的良好性能。

摘要:

近年来,针对复杂几何上的偏微分方程,基于非匹配或重叠网格的多种有限元方法已被提出。这类方法的例子包括虚拟区域法、扩展有限元法和Nitsche方法。在所有这些方法中,必须在切割单元或子单纯形上计算积分,这在实现上具有挑战性,尤其是在三维空间中。在本笔记中,我们解决了这种实现的主要挑战,并展示了一个完全通用的代码在自动检测网格交集以及在切割单元和子单纯形上进行积分的良好性能。作为重叠网格方法的一个典型例子,我们考虑Nitsche方法,并将其应用于泊松方程和线弹性问题。

英文摘要:

In recent years, a number of finite element methods have been formulated for the solution of partial differential equations on complex geometries based on non-matching or overlapping meshes. Examples of such methods include the fictitious domain method, the extended finite element method, and Nitsche's method. In all of these methods, integrals must be computed over cut cells or subsimplices which is challenging to implement, especially in three space dimensions. In this note, we address the main challenges of such an implementation and demonstrate good performance of a fully general code for automatic detection of mesh intersections and integration over cut cells and subsimplices. As a canonical example of an overlapping mesh method, we consider Nitsche's method which we apply to Poisson's equation and a linear elastic problem.

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

↑