![]() |
(3) |
| (4) |


In practice however it has been found that solutions exhibit the expected accuracy even on non-uniform grids. This phenomenon is known as supraconvergence. Cockburn and Gremaud [1] give a numerical example to illustrate this phenomenon.
The following numerical example shows that the inconsistency of the scheme on rough grids does not prevent it from converging at the optimal rate. In Figure 1 below we display the performance of the Engquist-Osher scheme on the classical example of the Burger's equation with periodic boundary conditions and a sinusoidal initial condition.
About 400 randomly generated - and thus non smooth - grids were considered.
The global
- error at the final time is represented with respect to
, size of the largest element. In Figure 1 (left), the exact
solution is smooth; the convergence rate is one. In Figure 1 (right), the
exact solution exhibits a discontinuity but, interestingly enough, the
scheme converges without any loss in the numerical rate of convergence. This
shows that the (formal) truncation error is a poor indicator of the
quality of a numerical algorithm.

They then go on to give a proper definition of truncation error and show that
.... the optimal rate of convergence of
in
can be obtained, even for inconsistent schemes, because the
consistency of the numerical flux and the fact that the scheme is
written in conservation form allow the regularity properties of the
numerical approximation to compensate for the lack of consistency of the
scheme; the nonlinearity of the problem does not play any role in this
mechanism.
So in practice, the order of accuracy of an upwind finite volume scheme is
determined by the accuracy with which the flux integral is evaluated. This
accuracy depends on the order of reconstruction/recovery (k, k=1 for
constant in cell approximation, k=2 for linear approximation, etc.) and the
order of Gaussian quadrature (which depends on the number of Guassian points
. Thus the practical order of
accuracy (r) is
Interestingly finite difference schemes are always consistent. To see this
let us first write the conservation law (1) in the flux split form
| (6) |
![]() |
(7) |
References