Lower Bounds of the Discretization for Piecewise Polynomials
Abstract
Assume that Vh is a space of piecewise polynomials of degree less than r≥ 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∈ [1, ∞] ∈fvh∈ Vh\|u-vh\|j,p,Ω,h C hr-j |u|r,p,Ω, 0 j r. In this paper, we prove that, roughly speaking, if u∈ Vh, the above estimate is sharp. Namely, ∈fvh∈ Vh\|u-vh\|j,p,Ω,h c hr-j, 0 j r, \ \ 1≤ p≤ ∞, 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.