arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2502.20993math.NAcs.NAmath.AP
收藏

Eikonal哈密顿-雅可比方程在网络上的临界值数值近似

Numerical Approximation of the Critical Value of Eikonal Hamilton-Jacobi Equations on Networks

Sapienza, University of Rome(罗马大学);Link Campus University(Link校园大学)

Valentina Coscetti, Marco Pozza

AI总结:

研究网络上Eikonal方程临界值的近似方法,基于时间依赖哈密顿-雅可比方程的长期行为,提供误差估计和数值测试,展示算法性能和收敛性。

摘要:

Eikonal方程的临界值是参数的唯一值,使得方程有解,并与相应均质问题的有效哈密顿量密切相关。本文研究了网络上Eikonal方程临界值的近似策略,基于相应时间依赖哈密顿-雅可比方程的长期行为。我们提供了误差估计和一些数值测试,展示了所提出算法的性能和收敛性质。

英文摘要:

The critical value of an eikonal equation is the unique value of a parameter for which the equation admits solutions and is deeply related to the effective Hamiltonian of a corresponding homogenization problem. We study approximation strategies for the critical value of eikonal equations posed on networks. They are based on the large time behavior of corresponding time-dependent Hamilton-Jacobi equations. We provide error estimates and some numerical tests, showing the performance and the convergence properties of the proposed algorithms.

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

↑