arXiv · 2611.17947
A narrow band method for non-causal discretizations of anisotropic eikonal equations, with adaptive width, sub-and super-solution construction, and quasi-linear complexity
Abstract
We describe a narrow band method for numerically solving anisotropic eikonal equations, and more generally static first order Hamilton-Jacobi equations with possibly non-convex Hamiltonians, discretized using standard schemes (semi-Lagrangian, upwind-differences, Lax-Friedrichs). The causality property is not needed, in contrast with the fast marching method. The proposed approach simultaneously builds a numerical sub-solution u and super-solution u to the problem, and adapts the width of the narrow band based on their comparison. We prove that (1 + $ε$)u $\ge$ u at termination, where $ε$ > 0 is any given tolerance parameter, and that the worst case complexity is O(N | ln $ε$| ln(N/$ε$)), where N denotes the number of discretization points, and the underlying constant is explicit in terms of those associated with the scheme properties. Numerical experiments illustrate our results.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jean-Marie Mirebeau, Yanis Mouheb. 2026-11-13. A narrow band method for non-causal discretizations of anisotropic eikonal equations, with adaptive width, sub-and super-solution construction, and quasi-linear complexity. https://searcharxiv.com/abs/2611.17947
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.