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

关于域依赖切割单元稳定性的相容性

On the consistency of the Domain of Dependence cut cell stabilization

Münster University(明斯特大学);Technical University of Darmstadt(达姆施塔特工业大学);TU Berlin(柏林工业大学)

Gunnar Birke, Christian Engwer, Jan Giesselmann, Sandra May

AI总结:

本文证明了域依赖切割单元稳定性在任意多项式次数下的一致性结果,为高阶方法的分析提供了理论支持。

摘要:

所谓的笛卡尔切割单元网格提供了生成网格的有效方法,但需要定制的数值方法以避免稳定性问题,尤其是在双曲情况下,显式时间步进方案的使用很常见。在这种情况下,由于潜在的任意小切割单元,对时间步长大小施加了不可行的限制。域依赖(DoD)稳定性允许基于底层笛卡尔网格的时间步长大小。作为不连续伽辽金(DG)方法的扩展,人们期望与纯DG情况下的准确性特性相似。虽然数值结果支持这一期望,但在分析层面,这只有在k=0时被彻底研究过。误差分析通常依赖于一致性结果。在本贡献中,我们证明了对于任意多项式次数和足够光滑的精确解,DoD稳定性的一致性结果。这反过来可能为方法在高阶情况下的更精细分析开辟道路。

英文摘要:

So called cartesian cut cell meshes provide efficient ways to generate meshes but do require tailored numerical methods to not suffer from stabilization issues, especially in the hyperbolic regime where the application of explicit time stepping schemes is common. In this scenario, due to potentially arbitrarily small cut cells, an infeasible restriction is imposed on the time step size. The Domain of Dependence (DoD) stabilization allows for a time step size based on the underlying Cartesian mesh. Being an extension of a discontinuous Galerkin (DG) method, one would expect similar accuracy properties as in the pure DG case. While numerical results do support this expectation, on the analytical level this has only been investigated thoroughly for $k=0$. Error analysis typically hinges on a consistency result. In this contribution we prove such a result for the DoD stabilization given an arbitrary polynomial degree and an exact solution of sufficient regularity. This in turn could open the way towards a more refined analysis of the method even in the high-order case.

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

↑