Numerical analysis demonstrates order-one L1 and Lp error bounds for monotone schemes in convex Hamilton–Jacobi equations, indicating tighter convergence guarantees.
We establish Lᵖ L p error estimates for monotone numerical schemes approximating convex Hamilton–Jacobi equations on the d -dimensional torus. Using the adjoint method and semiconcavity estimates, we first prove an L¹ L 1 error bound of order one for classical monotone schemes of Crandall–Lions type and semi-Lagrangian schemes under standard convexity assumptions on the Hamiltonian and semiconcavity assumptions on the initial datum. By interpolation with the classical L^∞ L ∞ estimate, we obtain Lᵖ L p estimates for every 1≤ p<+∞ 1 ≤ p < + ∞ .
No takes yet. Share an insight, caveat, or question.
Basti et al. (2026) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: