Skip to main content
Journal cover image

Generalized monotone schemes, discrete paths of extrema, and discrete entropy conditions

Publication ,  Journal Article
Lefloch, PG; Liu, JG
Published in: Mathematics of Computation
January 1, 1999

Solutions of conservation laws satisfy the monotonicity property: the number of local extrema is a non-increasing function of time, and local maximum/minimum values decrease/increase monotonically in time. This paper investigates this property from a numerical standpoint. We introduce a class of fully discrete in space and time, high order accurate, difference schemes, called generalized monotone schemes. Convergence toward the entropy solution is proven via a new technique of proof, assuming that the initial data has a finite number of extremum values only, and the flux-function is strictly convex. We define discrete paths of extrema by tracking local extremum values in the approximate solution. In the course of the analysis we establish the pointwise convergence of the trace of the solution along a path of extremum. As a corollary, we obtain a proof of convergence for a MUSCL-type scheme that is second order accurate away from sonic points and extrema.

Duke Scholars

Published In

Mathematics of Computation

DOI

ISSN

0025-5718

Publication Date

January 1, 1999

Volume

68

Issue

227

Start / End Page

1025 / 1055

Related Subject Headings

  • Numerical & Computational Mathematics
  • 4903 Numerical and computational mathematics
  • 4901 Applied mathematics
  • 0802 Computation Theory and Mathematics
  • 0103 Numerical and Computational Mathematics
  • 0102 Applied Mathematics
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Lefloch, P. G., & Liu, J. G. (1999). Generalized monotone schemes, discrete paths of extrema, and discrete entropy conditions. Mathematics of Computation, 68(227), 1025–1055. https://doi.org/10.1090/s0025-5718-99-01062-5
Lefloch, P. G., and J. G. Liu. “Generalized monotone schemes, discrete paths of extrema, and discrete entropy conditions.” Mathematics of Computation 68, no. 227 (January 1, 1999): 1025–55. https://doi.org/10.1090/s0025-5718-99-01062-5.
Lefloch PG, Liu JG. Generalized monotone schemes, discrete paths of extrema, and discrete entropy conditions. Mathematics of Computation. 1999 Jan 1;68(227):1025–55.
Lefloch, P. G., and J. G. Liu. “Generalized monotone schemes, discrete paths of extrema, and discrete entropy conditions.” Mathematics of Computation, vol. 68, no. 227, Jan. 1999, pp. 1025–55. Scopus, doi:10.1090/s0025-5718-99-01062-5.
Lefloch PG, Liu JG. Generalized monotone schemes, discrete paths of extrema, and discrete entropy conditions. Mathematics of Computation. 1999 Jan 1;68(227):1025–1055.
Journal cover image

Published In

Mathematics of Computation

DOI

ISSN

0025-5718

Publication Date

January 1, 1999

Volume

68

Issue

227

Start / End Page

1025 / 1055

Related Subject Headings

  • Numerical & Computational Mathematics
  • 4903 Numerical and computational mathematics
  • 4901 Applied mathematics
  • 0802 Computation Theory and Mathematics
  • 0103 Numerical and Computational Mathematics
  • 0102 Applied Mathematics