The five-point equations for the Poisson equation are
with prescribed boundary values. If , an interior maximal value is at most the average of its four neighbours. Since no neighbour exceeds the maximum, equality forces all four to equal it. Repeating along adjacent nodes propagates that value to the boundary. Thus the discrete maximum principle gives , in particular the usual positive-maximum bound with zero included.
For an error estimate assume the exact solution has bounded continuous fourth partial derivatives up to the boundary. The local truncation error then satisfies by the Taylor theorem. Put , so and on boundary nodes. The Discrete Poisson barrier on a square
satisfies exactly, on the grid boundary, and . Set . Then , with nonpositive boundary values. Applying the discrete maximum principle twice gives
For nonzero smooth Dirichlet boundary data , impose at the boundary nodes. The error still vanishes there, so the same argument and order apply, under the same fourth-derivative regularity of the exact solution. Smooth boundary values alone do not remove every possible corner-regularity issue.
Replace by . At a positive interior maximum , the neighbour average is no larger than , so . Thus cannot have such an interior maximum. The positive-maximum form of the discrete maximum principle therefore remains valid:
With the error equation is , where under the preceding regularity assumptions. Since for the same Discrete Poisson barrier on a square, the comparison functions prove
There is no loss of uniqueness: apply the positive-maximum argument to both signs of a homogeneous discrete solution. The continuous weak formulation also has the coercive bilinear form , so the added positive reaction term strengthens its positive energy.

Articles by others on the same topic (0)

There are currently no matching articles.