Take the boundary-fitted grid and assume the standard consistency of a numerical method hypothesis with bounded fourth partial derivatives. Taylor expansion along each coordinate, including a bounded fourth-order remainder, gives the five-point Laplacian truncation error
The numerical equation and exact grid values therefore imply , where with zero boundary values. Its discrete sine transform eigenvectors are , , and its eigenvalues are
The one-dimensional sine vectors form an orthogonal basis, hence so do their tensor products. The least eigenvalue occurs at . Since for , , so the Euclidean operator norm of is at most . There are residual components, and , giving
The factor matters: pointwise second-order consistency of a numerical method becomes first order in the unweighted Euclidean grid norm.
The PDF does not explicitly impose regularity on the exact solution. Without such a hypothesis its unrestricted error claim is false. Here is a counterexample, with a classical solution smooth in the open square and continuous with zero boundary values:
The sampled numerical solution separates as . Its error solves , where and . The one-dimensional residual is . At the first node,
The leading coefficient is strictly negative. Moreover on , so the triangular-average formula for the second difference and concavity of give . Thus the positive part of every residual is at most . The matrix has a nonnegative inverse, and its first diagonal inverse entry is at least , as follows from the nonnegative Neumann expansion of its tridiagonal matrix. The discrete comparison principle bounds the inverse image of the residual's positive part by , while the negative first residual gives . Hence for small . Since , the full Euclidean error is bounded below by a positive constant. It cannot be . Thus the boxed estimate holds for the intended smooth solution class; a regularity condition is genuinely necessary.

Articles by others on the same topic (0)

There are currently no matching articles.