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

通过求解双调和方程扩展水平集方法中的场

Extending fields in a level set method by solving a biharmonic equation

Queensland University of Technology(昆士兰科技大学)

Timothy J. Moroney, Dylan R. Lusmore, Scott W. McCue, D. L. Sean McElwain

AI总结:

本文提出通过求解双调和方程扩展水平集方法中的速度或其他场,无需显式接口属性,实现简单且高效,同时支持对称性和周期性。

摘要:

我们提出了一种通过求解双调和方程来计算水平集方法中速度或其他场扩展的方法。该方法不同于其他常用的速度扩展方法,因为它通过水平集函数完全隐式地处理界面。在计算扩展时不需要显式接口属性,如位置或界面速度。这些特性导致使用稀疏直接求解器或矩阵自由共轭梯度求解器实现特别简单。此外,我们提出了一种快速泊松预条件因子,可用于加速后者收敛。我们通过多个测试问题展示了双调和扩展的有效性,这些测试问题证明了其在界面附近产生平滑且准确扩展的能力。该方法的另一个特点是自然地处理对称性和周期性,通过其构造确保扩展场也尊重这些对称性。

英文摘要:

We present an approach for computing extensions of velocities or other fields in level set methods by solving a biharmonic equation. The approach differs from other commonly used approaches to velocity extension because it deals with the interface fully implicitly through the level set function. No explicit properties of the interface, such as its location or the velocity on the interface, are required in computing the extension. These features lead to a particularly simple implementation using either a sparse direct solver or a matrix-free conjugate gradient solver. Furthermore, we propose a fast Poisson preconditioner that can be used to accelerate the convergence of the latter. We demonstrate the biharmonic extension on a number of test problems that serve to illustrate its effectiveness at producing smooth and accurate extensions near interfaces. A further feature of the method is the natural way in which it deals with symmetry and periodicity, ensuring through its construction that the extension field also respects these symmetries.

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

↑