有障碍均曲率流:高效的近似与收敛分析
Obstacle Mean Curvature Flow: Efficient Approximation and Convergence Analysis
AI总结:
本文提出了一种高效计算有障碍均曲率流的数值方法,并证明了其收敛性及稳定性。
摘要:
我们介绍了一种简单而高效的数值方法来计算有障碍的均曲率流。该方法在Merrimam-Bence-Osher方案中加入了点更新,以强制约束,因此保持了原始方案的计算复杂度。值得注意的是,这种朴素的方案继承了有障碍均曲率流的两个关键结构性质:几何比较原理和最小化运动解释。后者立即意味着该方案的无条件稳定性。基于比较原理,我们证明了该方案收敛到有障碍均曲率流的粘性解。此外,利用最小化运动解释,我们展示了空间离散模型的收敛性。最后,我们为一个启发了本工作的物理模型展示了数值实验。
英文摘要:
We introduce a simple and efficient numerical method to compute mean curvature flow with obstacles. The method augments the Merrimam-Bence-Osher scheme with a pointwise update that enforces the constraint and therefore retains the computational complexity of the original scheme. Remarkably, this naive scheme inherits both crucial structural properties of obstacle mean curvature flow: a geometric comparison principle and a minimizing movements interpretation. The latter immediately implies the unconditional stability of the scheme. Based on the comparison principle we prove the convergence of the scheme to the viscosity solution of obstacle mean curvature flow. Moreover, using the minimizing movements interpretation, we show convergence of a spatially discrete model. Finally, we present numerical experiments for a physical model that inspired this work.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。