A Mehrstellen method gains accuracy by exploiting the differential equation in the local truncation error of a compact finite difference method stencil. The extra nearby values alone do not guarantee higher order: one must also modify the source term. Consider on a square with prescribed Dirichlet boundary data, using the same spacing in both directions.
For comparison, the five-point Laplacian has expansion
Its leading error is not a multiple of , because the mixed fourth derivative is missing. To obtain an isotropic leading error, consider a symmetric nine-point finite-difference stencil with weight on each axial neighbor, on each diagonal neighbor, and on the center, all divided by . Vanishing on constants and consistency of a numerical method require and . Taylor expansion then gives the fourth-derivative contribution
For this to equal we must choose , hence , . The resulting nine-point finite-difference stencil operator is
Its expansion, retaining the next term for later use, is
Thus by itself is second order on a general function. On a Poisson equation solution, however, . Approximating this known source derivative by gives the fourth-order Mehrstellen method equation
Equivalently, its two stencils are
The normalized local truncation error is , since . If the equation is multiplied by , the row residual is ; this change of normalization does not make the solution sixth order. The fourth-order correction of the nine-point Poisson stencil retains only the closest axial and diagonal unknowns. A fourth-order one-dimensional second derivative instead uses , widening the unknown stencil and introducing negative outer weights. Mehrstellen method accuracy is obtained by correcting known source values rather than widening that unknown stencil.
The compact scheme has useful stability and solvability properties. With homogeneous Dirichlet boundary data, is symmetric, has positive diagonal and nonpositive off-diagonal entries, and is a positive definite symmetric operator. Indeed its quadratic form is a sum of positive edge weights times squared differences, with boundary values set to zero. Vanishing of this sum would force a constant on the connected grid and then zero by connection to the boundary. Consequently the Dirichlet boundary condition linear system has a unique solution. The same weights give a discrete maximum principle: if at every interior node and on the boundary, a positive maximum inside would make every weighted difference to its neighbors nonpositive. Equality forces the maximum to propagate to the boundary, which is impossible. Thus everywhere.
This also turns consistency of a numerical method into a quantitative convergence result, rather than merely suggesting an order. Let , let be the normalized residual of the exact solution, and set . Exact Dirichlet boundary data imply on the boundary and . On the unit square the quadratic barrier
has exactly, is nonnegative on the boundary, and has maximum . If , then and , while both comparison functions are nonpositive on the boundary. The discrete maximum principle proves
This is maximum-norm convergence of the corrected nine-point Poisson scheme. It requires sufficient smoothness of the solution up to the boundary for the uniform truncation bound. On other domains the source and boundary closures must retain the required accuracy; boundary singularities can invalidate a smooth-solution order estimate.
The same expansion reveals how to add still more accuracy. Differentiating gives
Thus the sixth derivatives appearing in the term can also be expressed solely through the source. With exact source derivatives,
is the sixth-order source correction of the nine-point Poisson stencil, with normalized residual . If source derivatives are replaced by differences, must be approximated through fourth order and the fourth derivatives through second order to retain that accuracy. The unknowns still occupy the same nine-point finite-difference stencil; only evaluation of known source data becomes more elaborate. The same inverse bound yields sixth-order convergence when these approximations and the boundary data have matching accuracy.
A particularly instructive case is the Laplace equation, . Both displayed error corrections automatically vanish: and , which also makes the pure sixth derivatives sum to zero. Expanding the stencil two orders further gives, for a sufficiently smooth harmonic function,
For verification, the three eighth-derivative contributions are , and . Because is a harmonic function, their sum is . The example has , so this term is genuinely present. The unmodified harmonic nine-point scheme therefore has sixth-order nodal convergence under the same smoothness and boundary assumptions. This harmonic superconvergence of the nine-point stencil is special to harmonic functions; it should not be confused with the fourth-order source-corrected scheme for general Poisson equation data.
The appeal of Mehrstellenverfahren is this combination of a compact sparse matrix, favorable discrete maximum principle properties, and high accuracy obtained by using the governing equation. The derivation also shows precisely which accuracy belongs to the operator on arbitrary functions, which belongs to its action on solutions, and which survives in the computed boundary-value solution.
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.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact