Engquist-Osher flux 2026-10-07
The Engquist-Osher numerical flux is . It sends positive-speed contributions from the left state and negative-speed contributions from the right state. Its consistency and opposite monotonicities in the two arguments yield a monotone conservative scheme under the appropriate Courant–Friedrichs–Lewy condition. For the Inviscid Burgers equation, it is .
Finite volume method 2026-10-07
A finite volume method evolves cell integrals or cell averages by differences of shared interface numerical fluxes. For a scalar conservation law, . Sharing the same flux between neighboring cells makes conservation follow by telescoping.
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.