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

The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.

Semidiscrete Central-Upwind Schemes for Hyperbolic Conservation Laws and Hamilton--Jacobi Equations

Kurganov, Alexander, Noelle, Sebastian, Petrova, Guergana·2001·SIAM Journal on Scientific Computing

Abstract

We introduce new Godunov-type semidiscrete central schemes for hyperbolic systems of conservation laws and Hamilton--Jacobi equations. The schemes are based on the use of more precise information about the local speeds of propagation and can be viewed as a generalization of the schemes from [A. Kurganov and E. Tadmor, J. Comput. Phys., 160 (2000), pp. 241--282; A. Kurganov and D. Levy, SIAM J. Sci. Comput., 22 (2000), pp. 1461--1488; A. Kurganov and G. Petrova, A third-order semidiscrete genuinely multidimensional central scheme for hyperbolic conservation laws and related problems, Numer. Math., to appear] and [A. Kurganov and E. Tadmor, J. Comput. Phys., 160 (2000), pp. 720--742]. The main advantages of the proposed central schemes are the high resolution, due to the smaller amount of the numerical dissipation, and the simplicity. There are no Riemann solvers and characteristic decomposition involved, and this makes them a universal tool for a wide variety of applications. At the same time, the developed schemes have an upwind nature, since they respect the directions of wave propagation by measuring the one-sided local speeds. This is why we call them central-upwind schemes. The constructed schemes are applied to various problems, such as the Euler equations of gas dynamics, the Hamilton--Jacobi equations with convex and nonconvex Hamiltonians, and the incompressible Euler and Navier--Stokes equations. The incompressibility condition in the latter equations allows us to treat them both in their conservative and transport form. We apply to these problems the central-upwind schemes, developed separately for each of them, and compute the corresponding numerical solutions.

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/s1064827500373413

Cites

24 of 24 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 24 references

Cited by

See all 1,035

Metadata

Authors
Kurganov, A., Noelle, S., & Petrova, G.
Venue
SIAM Journal on Scientific Computing
Published
2001-01
Volume
23
Issue
3
Pages
707-740
ISSN
  • 1064-8275 (ISSN-L)
  • 1095-7197
OpenAlex
W2042336927
Cited by
1,035
References
24
FWCI
17.12
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: Semidiscrete Central-Upwind Schemes for Hyperbolic Conservation Laws and Hamilton--Jacobi Equations. https://app.cochat.ai/papers/10.1137/s1064827500373413
The paper
Kurganov, A., Noelle, S., & Petrova, G. (2001). Semidiscrete Central-Upwind Schemes for Hyperbolic Conservation Laws and Hamilton--Jacobi Equations. SIAM Journal on Scientific Computing. https://doi.org/10.1137/s1064827500373413

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.