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

数值方案及其收敛率研究非支配排序的Hamilton-Jacobi方程连续极限

Numerical schemes and rates of convergence for the Hamilton-Jacobi equation continuum limit of nondominated sorting

University of California, Berkeley(加州大学伯克利分校)

Jeff Calder

AI总结:

本文研究非支配排序的Hamilton-Jacobi方程连续极限的数值方案及收敛率,提出两种新方案并证明理论收敛率。

摘要:

非支配排序通过反复去除坐标wise最小元素将欧几里得空间中的点集分层。最近研究表明随机点集的非支配排序具有Hamilton-Jacobi方程的连续极限。显然的数值方案对此PDE的收敛率是O(h^1/n)(h>0的网格间距,维度n)。本文引入两种新的数值方案,具有形式收敛率O(h),并证明通常的理论收敛率O(h^1/2)。我们还展示了数值模拟结果,说明形式收敛率与理论收敛率之间的差异。

英文摘要:

Nondominated sorting arranges a set of points in Euclidean space into layers by repeatedly removing the coordinatewise minimal elements. It was recently shown that nondominated sorting of random points has a Hamilton-Jacobi equation continuum limit. The obvious numerical scheme for this PDE has a slow convergence rate of O(h^1/n) for a grid of spacing h>0 in dimension n. In this paper, we introduce two new numerical schemes that have formal rates of O(h) and we prove the usual O(h^1/2) theoretical rates. We also present the results of numerical simulations illustrating the difference between the formal and theoretical rates.

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

↑