Lower bounds of the discretization error for piecewise polynomials

From MaRDI portal



Abstract: Assume that Vh is a space of piecewise polynomials of degree less than rgeq1 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 pin[1,infty] inf_{v_hin V_h}|u-v_h|_{j,p,Omega,h} le C h^{r-j} |u|_{r,p,Omega},quad 0le jle r. In this paper, we prove that, roughly speaking, if uotinVh, the above estimate is sharp. Namely, inf_{v_hin V_h}|u-v_h|_{j,p,Omega,h} ge c h^{r-j},quad 0le jle r, 1leq pleq 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.


This paper is devoted to the study of a lower-bound error estimate and its applications for piecewise polynomial approximation in Sobolev spaces. The authors' work was inspired by some recent studies of lower-bound approximations of eigenvalues by finite element discretization for some elliptic partial differential operators. A type of lower-bound results of the error by piecewise polynomial approximation is proposed. As applications, the authors give the lower bounds of the discretization error for the second-order elliptic and \(2m\)-th-order elliptic problem by finite element methods. Main result: From the analysis, the idea and methods here can be extended to other problems and numerical methods that are based on the piecewise polynomial approximation. The lower bound of the approximation error holds when the family of partitions \(\{\tau_h\}\) is quasi-uniform.NEWLINENEWLINEThe lower bounds for a second-order elliptic problem and the corresponding eigenpair problem by the finite element method are derived. Some conforming and nonconforming elements that yield the lower bound of the discretization error are presented. The authors consider lower bounds of the discretization order for the \(2m\)-th-order elliptic problem and the corresponding eigenpair problem by the finite element method.




Cited in
(49)








This page was built for publication: Lower bounds of the discretization error for piecewise polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2862516)