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

Navier-斯托克斯方程高阶时空离散的CutFEM和鬼稳定技术

CutFEM and ghost stabilization techniques for higher order space-time discretizations of the Navier-Stokes equations

Mathias Anselmann, Markus Bause

摘要:

本文提出了一种新的基于高阶时空有限元离散的虚拟区域方法,并对该方法进行了计算分析,用于在演化区域上模拟非定常不可压Navier-斯托克斯方程。物理域被嵌入到一个固定的计算网格中,使得移动域的边界与背景网格发生任意交叉。这种切割有限元技术的潜力,高阶时空有限元法很少在文献中研究到目前为止,值得进一步阐明。该方法的关键成分是弱制定的Dirichlet边界条件的Nitsche的方法,灵活和有效的集成在所有类型的交叉点的细胞移动边界和空间扩展的离散物理量的整个计算背景网格,包括虚拟(鬼)子域的流体流动。因此,避免了昂贵的重新网格化和稀疏矩阵数据结构的自适应,并且加速了计算。为了防止虚假的振荡所造成的不规则的交叉点的网格细胞,惩罚,也隐含地定义的延伸到鬼域,被添加。这些技术被嵌入在一个任意的顺序,不连续的Galerkin离散的时间变量和一个inf-sup稳定的空间变量的离散。矩阵组装的并行实现进行了说明。在一个演化区域的数值实验中,证明了算法的最优阶收敛性。进一步考虑了圆柱绕流和运动障碍物绕流的二维基准问题。

英文摘要:

We propose and analyze computationally a new fictitious domain method, based on higher order space-time finite element discretizations, for the simulation of the nonstationary, incompressible Navier-Stokes equations on evolving domains. The physical domain is embedded into a fixed computational mesh such that arbitrary intersections of the moving domain's boundaries with the background mesh occur. The potential of such cut finite element techniques for higher order space-time finite element methods has rarely been studied in the literature so far and deserves further elucidation. The key ingredients of the approach are the weak formulation of Dirichlet boundary conditions by Nitsche's method, the flexible and efficient integration over all types of intersections of cells by moving boundaries and the spatial extension of the discrete physical quantities to the entire computational background mesh including fictitious (ghost) subdomains of fluid flow. Thereby, an expensive remeshing and adaptation of the sparse matrix data structure are avoided and the computations are accelerated. To prevent spurious oscillations caused by irregular intersections of mesh cells, a penalization, defining also implicitly the extension to ghost domains, is added. These techniques are embedded in an arbitrary order, discontinuous Galerkin discretization of the time variable and an inf-sup stable discretization of the spatial variables. The parallel implementation of the matrix assembly is described. The optimal order convergence properties of the algorithm are illustrated in a numerical experiment for an evolving domain. The well-known 2d benchmark of flow around a cylinder as well as flow around moving obstacles with arising cut cells and fictitious domains are considered further.

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

↑