Approximating gradients with continuous piecewise polynomial functions

Abstract

Motivated by conforming finite element methods for elliptic problems of second order, we analyze the approximation of the gradient of a target function by continuous piecewise polynomial functions over a simplicial mesh. The main result is that the global best approximation error is equivalent to an appropriate sum in terms of the local best approximations errors on elements. Thus, requiring continuity does not downgrade local approximability and discontinuous piecewise polynomials essentially do not offer additional approximation power, even for a fixed mesh. This result implies error bounds in terms of piecewise regularity over the whole admissible smoothness range. Moreover, it allows for simple local error functionals in adaptive tree approximation of gradients.

21 pages, 1 figure

Cited by in corpus (9)

• A short note on plain convergence of adaptive least-squares finite element methods
• Robust Localization of the Best Error with Finite Elements in the Reaction-Diffusion Norm
• Convergence and Optimality of hp-AFEM
• Equivalence of local-and global-best approximations, a simple stable local commuting projector, and optimal $hp$ approximation estimates in $H(\mathrm{div})$
• Quasi-optimal nonconforming methods for symmetric elliptic problems. III -- DG and other interior penalty methods
• Near-best adaptive approximation on conforming meshes
• Constrained and unconstrained stable discrete minimizations for p-robust local reconstructions in vertex patches in the de Rham complex
• A quasi-optimal variant of the Hybrid High-Order method for elliptic PDEs with $H^{-1}$ loads
• Quasi-monotonicity and Robust Localization with Continuous Piecewise Polynomials