arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.04322math.NAcs.NAmath.OC
收藏

角落情况、奇点和动态因式分解

Corner cases, singularities, and dynamic factoring

Cornell University(康奈尔大学)

Dongping Qi, Alexander Vladimirsky

AI总结:

本文提出了一种动态因式分解方法,用于处理由不光滑边界或PDE系数不连续引起的二维稀疏现象,恢复了一阶收敛性。

摘要:

在Eikonal方程中,稀疏现象是一种常见现象,已知会降低数值方法的收敛速度。'因式分解'方法通过推导一个新的(局部光滑)变量的PDE来缓解这一困难,同时在已知的(非光滑)'因子'中捕捉与稀疏相关的奇点。此前该技术已成功用于解决点源处的稀疏扇形。在本文中,我们展示了如何使用类似的想法来分解由于边界不光滑或PDE系数不连续引起的二维稀疏现象。这些稀疏扇形的位置和方向在事先未知,我们构建了一种'及时因式分解'方法,动态识别它们。所得到的算法是快速推进方法的推广,最初用于常规(未分解)Eikonal方程。我们证明了我们的方法恢复了一阶收敛性,并通过一系列迷宫导航示例(具有不可渗透和'缓慢渗透'障碍物)进行了演示。

英文摘要:

In Eikonal equations, rarefaction is a common phenomenon known to degrade the rate of convergence of numerical methods. The `factoring' approach alleviates this difficulty by deriving a PDE for a new (locally smooth) variable while capturing the rarefaction-related singularity in a known (non-smooth) `factor'. Previously this technique was successfully used to address rarefaction fans arising at point sources. In this paper we show how similar ideas can be used to factor the 2D rarefactions arising due to nonsmoothness of domain boundaries or discontinuities in PDE coefficients. Locations and orientations of such rarefaction fans are not known in advance and we construct a `just-in-time factoring' method that identifies them dynamically. The resulting algorithm is a generalization of the Fast Marching Method originally introduced for the regular (unfactored) Eikonal equations. We show that our approach restores the first-order convergence and illustrate it using a range of maze navigation examples with non-permeable and `slowly permeable' obstacles.

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

↑