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

Citation
Pg. Lefloch et Jg. Liu, Generalized monotone schemes, discrete paths of extrema, and discrete entropy conditions, MATH COMPUT, 68(227), 1999, pp. 1025-1055
Citations number
40
Categorie Soggetti
Mathematics
Journal title
MATHEMATICS OF COMPUTATION
ISSN journal
00255718 → ACNP
Volume
68
Issue
227
Year of publication
1999
Pages
1025 - 1055
Database
ISI
SICI code
0025-5718(199907)68:227<1025:GMSDPO>2.0.ZU;2-Y
Abstract
Solutions of conservation laws satisfy the monotonicity property: the numbe r of local extrema is a non-increasing function of time, and local maximum/ minimum values decrease/increase monotonically in time. This paper investig ates this property from a numerical standpoint. We introduce a class of ful ly discrete in space and time, high order accurate, difference schemes, cal led generalized monotone schemes. Convergence toward the entropy solution i s 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 c onvex. We define discrete paths of extrema by tracking local extremum value s in the approximate solution. In the course of the analysis Ne establish t he pointwise convergence of the trace of the solution along a path of extre mum. As a corollary, we obtain a proof of convergence fdr a MUSCL-type sche me that is second order accurate away from sonic points and extrema.