Issue |
ESAIM: M2AN
Volume 38, Number 2, March-April 2004
|
|
---|---|---|
Page(s) | 345 - 357 | |
DOI | https://doi.org/10.1051/m2an:2004016 | |
Published online | 15 March 2004 |
A note on (2K+1)-point conservative monotone schemes
1
LMAM, School of Mathematical Sciences, Peking University,
Beijing 100871, PR China,
hztang@math.pku.edu.cn.
2
Institüt für Analysis und Numerik, Otto–von–Guericke
Universität Magdeburg, 39106 Magdeburg, Germany, Gerald.Warnecke@mathematik.uni-magdeburg.de.
Received:
15
December
2003
First–order accurate monotone conservative schemes have good convergence and stability properties, and thus play a very important role in designing modern high resolution shock-capturing schemes. Do the monotone difference approximations always give a good numerical solution in sense of monotonicity preservation or suppression of oscillations? This note will investigate this problem from a numerical point of view and show that a (2K+1)-point monotone scheme may give an oscillatory solution even though the approximate solution is total variation diminishing, and satisfies maximum principle as well as discrete entropy inequality.
Mathematics Subject Classification: 35L65 / 65M06 / 65M10
Key words: Hyperbolic conservation laws / finite difference scheme / monotone scheme / convergence / oscillation.
© EDP Sciences, SMAI, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.