Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 366

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

Sethian, James A., Vladimirsky, Alexander·2003·SIAM Journal on Numerical Analysis

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/s0036142901392742

Cites

13 of 13 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 13 references

Cited by

See all 366

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.