Skip to main content
Log in

Small data oscillation implies the saturation assumption

  • Original article
  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary.

The saturation assumption asserts that the best approximation error in \(H^1_0\) with piecewise quadratic finite elements is strictly smaller than that of piecewise linear finite elements. We establish a link between this assumption and the oscillation of \(f=-\Delta u\), and prove that small oscillation relative to the best error with piecewise linears implies the saturation assumption. We also show that this condition is necessary, and asymptotically valid provided \(f\in L^2\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received November 17, 2000 / Published online July 25, 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dörfler, W., Nochetto, R. Small data oscillation implies the saturation assumption. Numer. Math. 91, 1–12 (2002). https://doi.org/10.1007/s002110100321

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002110100321

Navigation