arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2412.02555math.NAcs.NA
收藏

基于三角剖分的边基离散化方法,特别关注四维空间

Edge-based discretizations on triangulations in $\mathbb{R}^d$, with special attention to four-dimensional space

Pennsylvania State University(宾夕法尼亚州立大学);National Institute of Aerospace(国家航空航天研究所)

Nicholas Tufillaro, David M. Williams, Hiroaki Nishikawa

AI总结:

本文提出了一种在任意维度中基于三角剖分的中位数-对偶区域定义,并介绍了计算其超体积和定向超面积向量的新方法,用于开发鲁棒的节点中心边基方案。

摘要:

许多计算流体力学领域的时间依赖性问题可以通过时空方法求解。然而,此类方法可能会遇到计算成本和鲁棒性的问题。为了解决这些问题,目前正在开发高效的、以节点为中心的边基方案。在这些方案中,基于初始三角剖分构建了空间-时间域的中位数-对偶剖分。这些方法是节点中心的或节点基的,因为离散化的主成分是中位数-对偶区域(多面体),这些区域包围网格节点。这些方法非常鲁棒,因为中位数-对偶区域通常会保持正体积和其他良好的几何特性,即使某些相关单纯形具有负体积或其他不良的几何特性。不幸的是,对于d≥3的情况,在三角剖分上构造中位数-对偶区域或推导其属性并不直观。在本工作中,我们提供了三角剖分上中位数-对偶区域的首个严格定义,适用于任意维度。此外,我们介绍了一种新的方法,用于计算中位数-对偶区域在R^d中的超体积。此外,我们还提供了一种新的方法,用于计算四维空间中中位数-对偶区域面的定向超面积向量。这些几何特性对于在任意维度中开发节点中心边基方案至关重要。我们通过分析边基方案的计算复杂性,并在二维、三维和四维中进行数值实验,最后通过获得几个经典问题的准确解来证明其有效性。

英文摘要:

Many time-dependent problems in the field of computational fluid dynamics can be solved using space-time methods. However, such methods can encounter issues with computational cost and robustness. In order to address these issues, efficient, node-centered edge-based schemes are currently being developed. In these schemes, a median-dual tessellation of the space-time domain is constructed based on an initial triangulation. These methods are node-centered or node-based, as the primary components of the discretization are median-dual regions (polytopes) which surround the mesh nodes. These methods are extremely robust, as the median-dual regions will often maintain a positive volume and other good geometric properties, even in cases when some of the associated simplices have negative volumes, or other poor geometric properties. Unfortunately, it is not straightforward to construct median-dual regions or deduce their properties on triangulations for $d \geq 3$. In this work, we provide the first rigorous definition of median-dual regions on triangulations in any number of dimensions. In addition, we introduce a new method for computing the hypervolume of a median-dual region in $\mathbb{R}^d$. Furthermore, we provide a new approach for computing the directed-hyperarea vectors for faces of a median-dual region in $\mathbb{R}^{4}$. These geometric properties are key for developing node-centered edge-based schemes in any number of dimensions. We conclude our work by analyzing the computational complexity of the edge-based schemes, and performing numerical experiments in two, three, and four dimensions. We successfully demonstrate their effectiveness by obtaining accurate solutions to several canonical problems.

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

↑