Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
SIAM Journal on Scientific and Statistical Computing
Article . 1988 . Peer-reviewed
Data sources: Crossref
versions View all 2 versions
addClaim

Total-Variation-Diminishing Time Discretizations

Total-variation-diminishing time discretizations
Authors: Shu, Chiwang;

Total-Variation-Diminishing Time Discretizations

Abstract

For the approximate solution of hyperbolic conservation laws \(u_ t+\sum^{d}_{i=1}f_ i(u)_{x_ i}=0\) for \(u\in {\mathbb{R}}^ m\) and \(x\in {\mathbb{R}}^ d\) difference schemes with the property of diminishing the total variation are a successful tool. In the present paper the scalar, one-dimensional case is considered and discussed, only. For steady state calculations, in which time accuracy is not important, a class of Runge-Kutta m-step time discretizations with a large CFL number is presented. On the other hand, for time-dependent problems a class of high order multilevel time discretizations with the total variation diminishing property is outlined.

Keywords

Hyperbolic conservation laws, Finite difference methods for initial value and initial-boundary value problems involving PDEs, total-variation-diminishing time discretizations, Runge-Kutta method, Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    846
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 0.1%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 0.1%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
846
Top 0.1%
Top 0.1%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!