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

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

Non-dominated sorting arranges a set of points in n-dimensional 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(h1n). In this paper, we introduce two new numerical schemes that have formal rates of O(h) and we prove the usual O(h) theoretical rates. We also present the results of numerical simulations illustrating the difference between the formal and theoretical rates.

Original languageEnglish (US)
Pages (from-to)819-856
Number of pages38
JournalNumerische Mathematik
Volume137
Issue number4
DOIs
StatePublished - Dec 1 2017

Keywords

  • 35D40
  • 35F21
  • 65N06

Fingerprint Dive into the research topics of 'Numerical schemes and rates of convergence for the Hamilton–Jacobi equation continuum limit of nondominated sorting'. Together they form a unique fingerprint.

Cite this