The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
Abstract
We develop a family of fast methods for approximating the solutions to a wide class of static Hamilton--Jacobi PDEs; these fast methods include both semi-Lagrangian and fully Eulerian versions. Numerical solutions to these problems are typically obtained by solving large systems of coupled nonlinear discretized equations. Our techniques, which we refer to as "Ordered Upwind Methods" (OUMs), use partial information about the characteristic directions to decouple these nonlinear systems, greatly reducing the computational labor. Our techniques are considered in the context of control-theoretic and front-propagation problems. We begin by discussing existing OUMs, focusing on those designed for isotropic problems. We then introduce a new class of OUMs which decouple systems for general (anisotropic) problems. We prove convergence of one such scheme to the viscosity solution of the corresponding Hamilton--Jacobi PDE. Next, we introduce a set of finite-differences methods based on an analysis of the role played by anisotropy in the context of front propagation and optimal trajectory problems. The performance of the methods is analyzed, and computational experiments are performed using test problems from computational geometry and seismology.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Partial Differential Equations
(1988) · Lecture Notes in Mathematics · doi:10.1007/bfb0082920 · Cited by 23,383
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
A fast marching level set method for monotonically advancing fronts.
Sethian, J. A. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.4.1591 · Cited by 3,221
Self-citationLevel Set Methods: An Overview and Some Recent Results
Osher, S., & Fedkiw, R. P. (2001) · Journal of Computational Physics · doi:10.1006/jcph.2000.6636 · Cited by 2,327
Sethian, J. A. (1999) · SIAM Review · doi:10.1137/s0036144598347059 · Cited by 1,602
Self-citationA Fast Level Set Method for Propagating Interfaces
Adalsteinsson, D., & Sethian, J. A. (1995) · Journal of Computational Physics · doi:10.1006/jcph.1995.1098 · Cited by 1,326
Self-citationSome properties of viscosity solutions of Hamilton-Jacobi equations
Crandall, M. G., Evans, L. C., & Lions, P.-L. (1984) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1984-0732102-x · Cited by 1,176
Computing geodesic paths on manifolds
Kimmel, R., & Sethian, J. A. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.15.8431 · Cited by 1,049
Self-citationNumerical Methods for Stochastic Control Problems in Continuous Time
Kushner, H. J., & Dupuis, P. G. (1992) · Springer eBooks · doi:10.1007/978-1-4684-0441-8 · Cited by 625
Cited by
A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
Mitchell, I. M., Bayen, A. M., & Tomlin, C. J. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.851439 · Cited by 1,152
Path Planning for Autonomous Mobile Robots: A Review
Sánchez-Ibáñez, J. R., Pérez-del-Pulgar, C. J., & García-Cerezo, A. (2021) · Sensors · doi:10.3390/s21237898 · Cited by 462
Path Planning for Autonomous Underwater Vehicles
Petres, C., Pailhas, Y., Patron, P., Petillot, Y., Evans, J., & Lane, D. (2007) · IEEE Transactions on Robotics · doi:10.1109/tro.2007.895057 · Cited by 433
Hassouna, M. S., & Farag, A. A. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1154 · Cited by 323
Metadata
- Authors
- Sethian, J. A., & Vladimirsky, A.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 2003-01
- Volume
- 41
- Issue
- 1
- Pages
- 325-363
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2055341194
- Cited by
- 366
- References
- 13
- FWCI
- 15.60
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms. https://app.cochat.ai/papers/10.1137/s0036142901392742
- The paper
- Sethian, J. A., & Vladimirsky, A. (2003). Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms. SIAM Journal on Numerical Analysis. https://doi.org/10.1137/s0036142901392742
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.