Discrete entropy inequality Created 2026-10-07 Updated 2026-10-14
For a scalar conservative monotone update with flux , define . Monotonicity and preservation of constant states give . At equal states , the Kruzhkov entropy flux. Such discrete inequalities connect stability of a monotone conservative scheme with the admissibility of its limiting entropy solution.
Apply the entropy solution inequality for with level and for with level , integrate both in the other pair of variables, and add them. Symmetry of the Kruzhkov entropy flux produces derivatives and . A nonnegative mollifier concentrated near the diagonal then yields the Kato inequality for scalar conservation laws. Boundary-time terms require an initial trace argument, not merely interior translation continuity.
The Engquist-Osher method is an upwind finite volume method. For cell values , mesh width and time step , put and use the conservative update
where the numerical flux is
Consistency of a numerical method follows from . Positive characteristic speeds use the left state, and negative speeds use the right state. The flux difference telescopes when summed over cells, giving a discrete conservation law. The method is first order in space and time for smooth solutions; its conservation law form is also appropriate when shock waves develop.
Let be the unique sonic point of a scalar flux, . Convexity implies to its left and to its right. Put and split
Then , , , and
This is the sonic-point splitting of a convex Engquist-Osher flux. If both states are above , ; if both are below it, . Across a transsonic rarefaction wave, , the flux is the minimum . In the opposite crossing it is , which in general differs from the exact Godunov numerical flux. This distinction does not affect the monotonicity proof.
Here stability requires the usual Courant–Friedrichs–Lewy condition. Let the initial values lie in , and choose
A differentiable convex function has a continuous derivative on this interval, so the maximum is finite. Write the three-input update as . Differentiating gives
Thus the update preserves componentwise order. Constants are fixed, since , so comparison with the constants proves for every time level. In particular the same CFL condition remains applicable. This is a mesh-independent maximum-principle stability bound.
A stronger stability statement is contraction in discrete . Consider two solutions in the same invariant interval, on a periodic mesh or on the infinite lattice with summable differences. Let be their componentwise maximum. Monotonicity gives , hence
The discrete conservation law for the difference gives the equality: on a finite periodic mesh the flux sum cancels exactly, and on the infinite lattice it follows by truncation and the fact that the flux is a Lipschitz function on . Interchanging and adding proves
This is L1 contraction of a monotone conservative scheme. Since commutes with the cell shift, applying this contraction to and its shift gives . The scheme is therefore a total variation diminishing scheme as well.
The same order argument proves a discrete entropy inequality, explaining why this stable discretization selects entropy solutions rather than nonphysical expansion shock waves. For a constant , set
Because and , their componentwise difference is at least . Subtracting their updates gives
For constants outside , the entropy inequality is an equality by the invariant bound and the conservative update. At equal states , the Kruzhkov entropy flux. The flux is a Lipschitz function on the invariant interval: writing , the conservative update gives . This time-translation bound, the invariant bound and the total variation estimate give local space-time compactness for bounded-variation initial conditions as the mesh is refined; the conservative update passes to the weak conservation law, and the displayed inequality passes to its Kruzhkov entropy inequality. This identifies the limit as the entropy solution.
Finally the time-step qualification is essential. For the convex Inviscid Burgers equation flux , whose unique sonic point of a scalar flux is zero, linearize about a positive constant . The perturbation update becomes . At Fourier frequency its multiplier is , with modulus greater than one if . Wave packets near this phase give linear instability even for summable Cauchy perturbations. Thus the assumptions on imply the stability results above under the CFL condition, not for arbitrary . This is CFL necessity for explicit Engquist-Osher stability.
The Engquist-Osher method is a conservative finite volume method built by separating positive and negative characteristic speeds. Take , a uniform cell width , a time step , and cell averages . Write and define the numerical flux
The Engquist-Osher flux uses the left state for right-going transport and the right state for left-going transport. Its conservative update is
It is consistent because . The integrals have their ordinary oriented meaning even for negative states. For the Inviscid Burgers equation, gives the useful example
In a region where all characteristic speeds have one sign, the flux reduces to the corresponding upwind flux. In smooth regions, this basic piecewise-constant, forward-time version is first order in space and time; its main virtue is robust nonlinear stability across shocks.
Here is a precise stability proof. Assume the data lie in a bounded interval and choose
Work on a periodic grid, or on the infinite grid with summable differences; on a finite interval the inflow boundary data and boundary fluxes must be treated monotonically as well. Define the three-point update map
Writing and , its three partial derivatives are
Thus it is a monotone conservative scheme. Since , comparison with the constant states proves
The interval is invariant, so the same Courant–Friedrichs–Lewy condition remains valid at every step. This is an bound relative to constant states, not a claim that arbitrary pairs of solutions are contractive in .
For a stronger perturbation estimate, let denote the global update and use componentwise maxima. Monotonicity gives . Therefore
Sum over the grid. The shared interface flux cancels telescopically, so conservation gives
Interchanging and adding yields the L1 contraction of a monotone conservative scheme:
This is a mesh-independent nonlinear stability estimate. On an infinite grid the telescoping argument is justified by summability of the differences and the bounded characteristic-speed range, or by truncation followed by a limit. For unequal prescribed boundary data, additional boundary flux terms enter the estimate.
The method is also a total variation diminishing scheme. Let shift a grid sequence by one cell. Translation invariance gives . Applying the preceding contraction to and shows
Hence initially finite discrete total variation cannot grow.
Finally, monotonicity supplies a discrete entropy inequality, explaining why the stability is compatible with the physically admissible entropy solution. For a constant , define
Comparison of with the clipped triples above and below gives
Indeed and , and subtracting these two update formulas yields exactly the right side. Also , the Kruzhkov entropy flux. Under the displayed CFL condition the method therefore has an invariant state range, contraction, decreasing discrete total variation and entropy dissipation. These estimates remain meaningful at discontinuities, where linearized Fourier analysis alone cannot establish the corresponding nonlinear stability.
Since the derivative of is away from , choose the Kruzhkov entropy flux
On either side of its derivative is . The factor vanishes at the change of sign, so the function is continuous and there is no extra delta contribution to its weak derivative. Adding a constant to the flux changes none of the test integrals. Substitution into the entropy inequality pairs with this flux, not with an arbitrary antiderivative unrelated to the chosen entropy.