arXiv (All)
open access
$L^p$ Estimates for Numerical Approximation of Convex Hamilton-Jacobi Equations
We establish $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^1$ error bound of order one for classical monotone schemes of Crandall-Lions type
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Energy norm error estimates of a hybrid high-order method for the linear parabolic integro-differential equations on general meshes#1129226
- Analysis of Bregman Proximal Point for the Obstacle Problem#1048402
- Verifying Well-Posedness of Linear PDEs using Convex Optimization#1012174
- Sharp Metric Cotype Inequalities for $L_1$ via Nonlinear Cut Smoothing#987925
- Error Bounds for Boundary-Stopped Positive Cubature Schemes for Hamilton--Jacobi--Bellman Equations#1123571
Record · ID 998073
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive