Lower Bounds of the Discretization for Piecewise Polynomials

Abstract

Assume that $V_h$ is a space of piecewise polynomials of degree less than $r\ge 1$ on a family of quasi-uniform triangulation of size $h$. Then the following well-known upper bound holds for a sufficiently smooth function $u$ and $p\in [1,\infty ]$ $$\underset{v_h\in V_h}{\inf }\Vert u-v_h{\Vert }_{j,p,\Omega ,h}\le C{h}^{r-j}|u{|}_{r,p,\Omega },0\le j\le r.$$ In this paper, we prove that, roughly speaking, if $u\notin V_h$, the above estimate is sharp. Namely, $$\underset{v_h\in V_h}{\inf }\Vert u-v_h{\Vert }_{j,p,\Omega ,h}\ge c{h}^{r-j},0\le j\le r,1\le p\le \infty ,$$ for some $c>0$. The above result is further extended to various situations including more general Sobolev space norms, general shape regular grids and many different types of finite element spaces. As an application, the sharpness of finite element approximation of elliptic problems and the corresponding eigenvalue problems is established.

15

Cited by in corpus (2)

• A Full Multigrid Method for Eigenvalue Problems
• Sharp Error Bounds for Piecewise Polynomial Approximation: Revisit and Application to Elliptic PDE Eigenvalue Computation