Open Source
A narrow band method for non-causal discretizations of anisotropic eikonal equations, with adaptive width, sub-and super-solution construction, and quasi-linear complexity
arXiv cs.NA0 views
arXiv:2611.17947v1 Announce Type: new 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 + $\epsilon$)u $\ge$ u at termination, where $\epsilon$ > 0 is any given tolerance parameter, and that the worst case complexity is O(N | ln $\epsilon$| ln(N/$\epsilon$)), 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.
Source:https://arxiv.org/abs/2611.17947PreviousCompatible by Construction: Bottom-Up Nonlinear Model Reduction without Interface BasesNextA Realizability-Based Kinetic-Fluid Domain Decomposition Method for Single-Temperature Gas Mixtures
Related posts
TRACES.md: a plain-text flight recorder for what AI agents did
0dev.to Python
Show HN: Real-time collaborative KiCad
0Hacker News Show
Show HN: A geometry puzzle from an Erdős problem, with every optimum proven
0Hacker News Show
aisync: one local hub for rules and coordination across AI coding agents
0dev.to Productivity
Manifold Approximation leads to Robust Kernel Alignment
0arXiv stat.ML
Robots that Collaborate: Sequential Asymmetric Imitation for Learning Coupled Robot Policies
0arXiv cs.RO