arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.09620math.NAcs.NAphysics.comp-phphysics.flu-dyn

非结构三角形网格上的鲁棒 DG 格式:通过最优凸分解实现振荡消除与界保持

Robust DG Schemes on Unstructured Triangular Meshes: Oscillation Elimination and Bound Preservation via Optimal Convex Decomposition

Shengrong Ding, Shumo Cui, Kailiang Wu

AI总结:

针对非结构三角形网格上 DG 求解双曲守恒律的振荡与界保持问题,提出 RIOE 过程及 $P^1$、$P^2$ 最优凸分解,在保持紧致性的同时大幅提升 BP CFL 数。

摘要:

非结构网格上的间断 Galerkin(DG)格式具有紧致性以及处理复杂计算区域的能力。然而,它们在求解双曲守恒律时的鲁棒性和可靠性依赖于两项关键能力:抑制伪振荡,以及保持固有界或约束。本文介绍了两项重要进展,用于增强非结构网格上 DG 方法在求解一般双曲守恒律时的鲁棒性和效率,同时保持其精度与紧致性。首先,我们研究了非结构网格上的振荡消除(OE)DG 方法。这些方法不仅保持守恒性、尺度不变性和演化不变性等关键特征,还通过一种新的旋转不变 OE(RIOE)过程实现旋转不变性。其次,我们首次提出最优凸分解,用于在非结构网格上设计高效的界保持(BP)DG 格式。寻找使 BP CFL 数最大化的最优凸分解是一个重要且具有挑战性的问题。尽管这一挑战已在矩形网格上得到解决,但对于三角形网格仍是开放问题。本文成功地为三角形单元上广泛使用的 $P^1$ 和 $P^2$ 空间构造了最优凸分解,显著提高了 BP DG 方法的效率。与经典分解相比,最大 BP CFL 数在 $P^1$ 情形下提高了 100%–200%,在 $P^2$ 情形下提高了 280.38%–350%。此外,我们的 RIOE 过程和最优分解技术只需少量且局部的修改即可集成到现有 DG 代码中。这些技术仅需要边相邻单元的信息,从而保留了原始 DG 方法的紧致性和高并行效率。

英文摘要:

Discontinuous Galerkin (DG) schemes on unstructured meshes offer the advantages of compactness and the ability to handle complex computational domains. However, their robustness and reliability in solving hyperbolic conservation laws depend on two critical abilities: suppressing spurious oscillations and preserving intrinsic bounds or constraints. This paper introduces two significant advancements in enhancing the robustness and efficiency of DG methods on unstructured meshes for general hyperbolic conservation laws, while maintaining their accuracy and compactness. First, we investigate the oscillation-eliminating (OE) DG methods on unstructured meshes. These methods not only maintain key features such as conservation, scale invariance, and evolution invariance but also achieve rotation invariance through a novel rotation-invariant OE (RIOE) procedure. Second, we propose, for the first time, the optimal convex decomposition for designing efficient bound-preserving (BP) DG schemes on unstructured meshes. Finding the optimal convex decomposition that maximizes the BP CFL number is an important yet challenging problem.While this challenge was addressed for rectangular meshes, it remains an open problem for triangular meshes. This paper successfully constructs the optimal convex decomposition for the widely used $P^1$ and $P^2$ spaces on triangular cells, significantly improving the efficiency of BP DG methods.The maximum BP CFL numbers are increased by 100%--200% for $P^1$ and 280.38%--350% for $P^2$, compared to classic decomposition. Furthermore, our RIOE procedure and optimal decomposition technique can be integrated into existing DG codes with little and localized modifications. These techniques require only edge-neighboring cell information, thereby retaining the compactness and high parallel efficiency of original DG methods.

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

↑