The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Total-Variation-Diminishing Time Discretizations
Abstract
In the computation of conservation laws $u_t + f(u)_x = 0$, total-variation-diminishing (TVD) schemes have been very successful. Many TVD schemes are of method-of-lines form (i.e., discretized in spatial variables only); hence time discretizations that keep TVD and have other properties (e.g., large CFL numbers for steady state calculations, or high-order accuracy for time-dependent problems) are desirable. In this paper we present a class of m-step Runge–Kutta-type TVD time discretizations with large CFL number m, suitable for steady state calculations, and a class of multilevel type TVD high-order time discretizations suitable for time-dependent problems. Some preliminary numerical results are also given.
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
Approximate Riemann solvers, parameter vectors, and difference schemes
Roe, P. L. (1981) · Journal of Computational Physics · doi:10.1016/0021-9991(81)90128-5 · Cited by 9,232
Approximate Riemann Solvers, Parameter Vectors, and Difference Schemes
Roe, P. L. (1997) · Journal of Computational Physics · doi:10.1006/jcph.1997.5705 · Cited by 6,277
Efficient implementation of essentially non-oscillatory shock-capturing schemes, II
Shu, C.-W., & Osher, S. (1989) · Journal of Computational Physics · doi:10.1016/0021-9991(89)90222-2 · Cited by 4,851
Self-citationHigh resolution schemes for hyperbolic conservation laws
Harten, A. (1983) · Journal of Computational Physics · doi:10.1016/0021-9991(83)90136-5 · Cited by 4,228
Uniformly high order accurate essentially non-oscillatory schemes, III
Harten, A., Engquist, B., Osher, S., & Chakravarthy, S. R. (1987) · Journal of Computational Physics · doi:10.1016/0021-9991(87)90031-3 · Cited by 3,002
Computational Methods in Ordinary Differential Equations
Lambert, J. D. (1973) · Cited by 1,371
Computational methods in ordinary differential equations
Zhurin, V. V. (1973) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(73)90124-9 · Cited by 1,319
Uniformly High-Order Accurate Nonoscillatory Schemes. I
Harten, A., & Osher, S. (1987) · SIAM Journal on Numerical Analysis · doi:10.1137/0724022 · Cited by 1,008
Cited by
Strong Stability-Preserving High-Order Time Discretization Methods
Gottlieb, S., Shu, C.-W., & Tadmor, E. (2001) · SIAM Review · doi:10.1137/s003614450036757x · Cited by 2,565
Self-citationTotal variation diminishing Runge-Kutta schemes
Gottlieb, S., & Shu, C.-W. (1998) · Mathematics of Computation · doi:10.1090/s0025-5718-98-00913-2 · Cited by 2,527
Self-citationKurganov, A., & Tadmor, E. (2000) · Journal of Computational Physics · doi:10.1006/jcph.2000.6459 · Cited by 1,938
Shu, C.-W. (1998) · Lecture Notes in Mathematics · doi:10.1007/bfb0096355 · Cited by 1,919
Self-citationA PDE-Based Fast Local Level Set Method
Peng, D., Merriman, B., Osher, S., Zhao, H., & Kang, M. (1999) · Journal of Computational Physics · doi:10.1006/jcph.1999.6345 · Cited by 1,255
Semidiscrete Central-Upwind Schemes for Hyperbolic Conservation Laws and Hamilton--Jacobi Equations
Kurganov, A., Noelle, S., & Petrova, G. (2001) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827500373413 · Cited by 1,035
High Order Weighted Essentially Nonoscillatory Schemes for Convection Dominated Problems
Shu, C.-W. (2009) · SIAM Review · doi:10.1137/070679065 · Cited by 964
Self-citationImplicit–Explicit Runge–Kutta Schemes and Applications to Hyperbolic Systems with Relaxation
Pareschi, L., & Russo, G. (2005) · Journal of Scientific Computing · doi:10.1007/s10915-004-4636-4 · Cited by 529
Shu, C.-W. (2003) · International Journal of Computational Fluid Dynamics · doi:10.1080/1061856031000104851 · Cited by 469
Self-citationSolution of two‐dimensional Riemann problems for gas dynamics without Riemann problem solvers
Kurganov, A., & Tadmor, E. (2002) · Numerical Methods for Partial Differential Equations · doi:10.1002/num.10025 · Cited by 398
Central-Upwind Schemes for the Saint-Venant System
Kurganov, A., & Levy, D. (2002) · ESAIM: Mathematical Modelling and Numerical Analysis · doi:10.1051/m2an:2002019 · Cited by 323
Maxwell, R. M., Putti, M., Meyerhoff, S., Delfs, J., Ferguson, I. M., Ivanov, V., Kim, J., Kolditz, O., Kollet, S. J., Kumar, M., et al. (2014) · Water Resources Research · doi:10.1002/2013wr013725 · Cited by 322
Well-balanced finite volume schemes of arbitrary order of accuracy for shallow water flows
Noelle, S., Pankratz, N., Puppo, G., & Natvig, J. R. (2006) · Journal of Computational Physics · doi:10.1016/j.jcp.2005.08.019 · Cited by 314
High-order methods for the Euler and Navier–Stokes equations on unstructured grids
Wang, Z. J. (2007) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2007.05.001 · Cited by 307
A simple embedding method for solving partial differential equations on surfaces
Ruuth, S. J., & Merriman, B. (2008) · Journal of Computational Physics · doi:10.1016/j.jcp.2007.10.009 · Cited by 264
Finite-volume schemes for shallow-water equations
Kurganov, A. (2018) · Acta Numerica · doi:10.1017/s0962492918000028 · Cited by 108
Metadata
- Authors
- Shu, C.-W.
- Venue
- SIAM Journal on Scientific and Statistical Computing
- Published
- 1988-11
- Volume
- 9
- Issue
- 6
- Pages
- 1073-1084
- ISSN
- 0196-5204 (ISSN-L)
- 2168-3417
- OpenAlex
- W2093711514
- Cited by
- 1,085
- References
- 8
- FWCI
- 3.05
- 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
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.