Lower bounds of the discretization error for piecewise polynomials

Qun Lin, Hehu Xie, Jinchao Xu

Research output: Contribution to journalArticlepeer-review

38 Scopus citations


Assume that Vh is a space of piecewise polynomials of a degree less than r ≥ 1 on a family of quasi-uniform triangulation of size h. There exists the well-known upper bound of the approximation error by Vh for a sufficiently smooth function. In this paper, we prove that, roughly speaking, if the function does not belong to Vh, the upper-bound error estimate is also sharp. This result is further extended to various situations including 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.

Original languageEnglish (US)
Pages (from-to)1-13
Number of pages13
JournalMathematics of Computation
Issue number285
StatePublished - Jan 1 2014

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Lower bounds of the discretization error for piecewise polynomials'. Together they form a unique fingerprint.

Cite this