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

一个低复杂度算法用于非单调演变的前沿

A low complexity algorithm for non-monotonically evolving fronts

McGill University(麦吉尔大学)

Alexandra Tcheng, Jean-Christophe Nave

AI总结:

本文提出一种低复杂度算法,用于描述在法向方向以给定速度函数F传播的前沿。通过结合快速推进法和通用快速推进法,该算法在多数情况下具有与快速推进法相当的计算复杂度,适用于速度非零的区域和近似为零的区域。

摘要:

本文提出了一种新的算法,用于描述在法向方向以给定速度函数F传播的前沿。假设F不依赖于前沿本身,但可以依赖于空间和时间,并且可以消失并改变符号。为了解决这个问题,广泛使用了水平集方法[Osher, Sethian; 1988],而通用快速推进法[Carlini等人; 2008]最近被引入。我们方法的新颖之处在于,其总体计算复杂度预计在大多数情况下与快速推进法[Sethian; 1996]、[Vladimirsky; 2006]相当。后者如果计算域包含N^n个点,则为O(N^n log N^n)。我们的策略是在速度远离零的区域使用它,并在F近似为零时切换到不同的形式化。为此,引入了一组所谓的侧面偏微分方程。它们的解局部描述了演化的前沿,并且依赖于空间和时间。这些方程的适定性和几何性质得到讨论。然后,我们提出了一种收敛且稳定的这些PDEs的离散化方法。这些替代表示用于增强标准的快速推进法。所得到的算法被提出,并对其特征进行了详细讨论。当F同时依赖于空间和时间时,该方案的准确性被测试。每个示例都产生O(1/N)的全局截断误差。最后,讨论了该方法的优势和限制。

英文摘要:

A new algorithm is proposed to describe the propagation of fronts advected in the normal direction with prescribed speed function F. The assumptions on F are that it does not depend on the front itself, but can depend on space and time. Moreover, it can vanish and change sign. To solve this problem the Level-Set Method [Osher, Sethian; 1988] is widely used, and the Generalized Fast Marching Method [Carlini et al.; 2008] has recently been introduced. The novelty of our method is that its overall computational complexity is predicted to be comparable to that of the Fast Marching Method [Sethian; 1996], [Vladimirsky; 2006] in most instances. This latter algorithm is O(N^n log N^n) if the computational domain comprises N^n points. Our strategy is to use it in regions where the speed is bounded away from zero -- and switch to a different formalism when F is approximately 0. To this end, a collection of so-called sideways partial differential equations is introduced. Their solutions locally describe the evolving front and depend on both space and time. The well-posedness of those equations, as well as their geometric properties are addressed. We then propose a convergent and stable discretization of those PDEs. Those alternative representations are used to augment the standard Fast Marching Method. The resulting algorithm is presented together with a thorough discussion of its features. The accuracy of the scheme is tested when F depends on both space and time. Each example yields an O(1/N) global truncation error. We conclude with a discussion of the advantages and limitations of our method.

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

↑