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

在具有拓扑保证的不规则域上进行几何积分

Geometric Integration Over Irregular Domains with topologic Guarantees

Institute for Computational und Applied Mathematics(计算与应用数学研究所)

Christian Engwer, Andreas Nüßing

AI总结:

本文提出一种基于多面体重构的几何积分算法,用于处理由一级连续水平集函数描述的不规则域,保持拓扑性质并实现二阶精度。

摘要:

隐式描述的域是时间依赖问题模拟中广泛应用的工具,如水平集方法。为在这些域上求解偏微分方程,发展了多种数值方法,如浸入边界法、不匹配有限元或不匹配间断 Galerkin 方法等。许多方法涉及对切割单元或其边界的积分,因为这些域由原始水平集网格的子域描述。本文提出了一种新的算法,用于几何上计算由一级连续水平集函数描述的域的积分。该积分基于多面体重构隐式几何,遵循Marching Cubes算法的概念。该算法在多面体重构中保持隐式几何的多种拓扑性质,使其适合有限元计算。数值实验显示积分的二阶精度。该算法的实现作为免费软件可用,可方便地集成到其他项目中。该软件已在DUNE框架中得到实际应用。

英文摘要:

Implicitly described domains are a well established tool in the simulation of time dependent problems, e.g. using level-set methods. In order to solve partial differential equations on such domains, a range of numerical methods was developed, e.g. the Immersed Boundary method, Unfitted Finite Element or Unfitted discontinuous Galerkin methods, eXtended or Generalised Finite Element methods, just to name a few. Many of these methods involve integration over cut-cells or their boundaries, as they are described by sub-domains of the original level-set mesh. We present a new algorithm to geometrically evaluate the integrals over domains described by a first-order, conforming level-set function. The integration is based on a polyhedral reconstruction of the implicit geometry, following the concepts of the Marching Cubes algorithm. The algorithm preserves various topological properties of the implicit geometry in its polyhedral reconstruction, making it suitable for Finite Element computations. Numerical experiments show second order accuracy of the integration. An implementation of the algorithm is available as free software, which allows for an easy incorporation into other projects. The software is in productive use within the DUNE framework.

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

↑