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.