Answers are grounded in this paper and cite their sources.
We study the Lax-Friedrichs scheme, approximating the scalar, genuinely nonlinear conservation law uₜ + fₓ(u) = 0, where $f(u)$ is, say, strictly convex, f a_ > 0. We show that the divided differences of the numerical solution at time t do not exceed 2(t a_ )- 1. This one-sided Lipschitz boundedness is in complete agreement with the corresponding estimate one has in the differential case; in particular, it is independent of the initial amplitude, in sharp contrast to linear problems. It guarantees the entropy compactness of the scheme in this case, as well as providing a quantitative insight into the large-time behavior of the numerical computation.
No takes yet. Share an insight, caveat, or question.
Eitan Tadmor (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: