High-order local rate of convergence by mesh-refinement in the finite element method

Abstract:

We seek approximations of the solution u of the Neumann problem for the equation $Lu = f$ in $\Omega$ with special emphasis on high-order accuracy at a given point ${x_0} \in \bar \Omega$. Here $\Omega$ is a bounded domain in ${R^N}(N \geqslant 2)$ with smooth boundary, and L is a second-order, uniformly elliptic, differential operator with smooth coefficients. An approximate solution ${u_h}$ is determined by the standard Galerkin method in a space of continuous piecewise polynomials of degree at most $r - 1$ on a partition ${\Delta _h}({x_0},\alpha )$ of $\Omega$. Here h is a global mesh-size parameter, and $\alpha$ is the degree of a certain systematic refinement of the mesh around the given point ${x_0}$, where larger $\alpha$’s mean finer mesh, and $\alpha = 0$ corresponds to the quasi-uniform case with no refinement. It is proved that, for suitable (sufficiently large) $\alpha$’s the high-order error estimate $(u - {u_h})({x_0}) = O({h^{2r - 2}})$ holds. A corresponding estimate with the same order of convergence is obtained for the first-order derivatives of $u - {u_h}$. These estimates are sharp in the sense that the required degree of refinement in each case is essentially the same as is needed for the local approximation to this order near ${x_0}$. For the estimates to hold, it is sufficient that the exact solution u have derivatives to the rth order which are bounded close to ${x_0}$ and square integrable in the rest of $\Omega$. The proof of this uses high-order negative-norm estimates of $u - {u_h}$. The number of elements in the considered partitions is of the same order as in the corresponding quasi-uniform ones. Applications of the results to other types of boundary value problems are indicated.