Math 2.0

Approximations and expansions Definition

Saturation of approximation methods

Builds on Banach spaceContinuous linear mapBig O notation

Definition

Let XX be a Banach space and let Ln ⁣:X→XL_n \colon X \to X, n≥1n \ge 1, be continuous linear maps. Let φ(n)>0\varphi(n) > 0 with φ(n)→0\varphi(n) \to 0. The sequence (Ln)(L_n) is saturated with saturation order φ(n)\varphi(n) if both conditions hold.

  1. If f∈Xf \in X and ∥Lnf−f∥=o(φ(n))\norm{L_n f - f} = o(\varphi(n)), then Lnf=fL_n f = f for all nn.
  2. Some f∈Xf \in X with Lnf≠fL_n f \ne f for some nn satisfies ∥Lnf−f∥=O(φ(n))\norm{L_n f - f} = O(\varphi(n)).

The saturation class is the set of f∈Xf \in X with ∥Lnf−f∥=O(φ(n))\norm{L_n f - f} = O(\varphi(n)), in big O notation.

Remarks

Example: the Bernstein operators BnB_n on C[0,1]C[0, 1] with the uniform norm are saturated with order 1/n1/n. For f(x)=x2f(x) = x^2 one has Bnf(x)=x2+x(1−x)nB_n f(x) = x^2 + \frac{x(1 - x)}{n}, so ∥Bnf−f∥=14n\norm{B_n f - f} = \frac{1}{4n}, which is O(1/n)O(1/n) but not o(1/n)o(1/n). The only ff with ∥Bnf−f∥=o(1/n)\norm{B_n f - f} = o(1/n) are the linear functions, which BnB_n reproduces.

Non-example: the Fourier partial sum operators SnS_n on L2L^2 of the circle are not saturated for any order. A trigonometric polynomial ff of degree k≥1k \ge 1 has Snf=fS_n f = f for n≥kn \ge k, so ∥Snf−f∥=o(φ(n))\norm{S_n f - f} = o(\varphi(n)), but S0f≠fS_0 f \ne f, so clause 1 fails.

The Fejér means of Fourier series are saturated with order 1/n1/n in CC of the circle, and only constants are approximated with error o(1/n)o(1/n). Saturation theorems typically identify the saturation class with a smoothness class, such as functions with Lipschitz first derivative for Bernstein operators.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Banach space concept
  2. Big O notation concept
  3. Continuous linear map concept
  4. Saturation of approximation methods definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Approximation_theory
About this page
Tag54BD10ZZDN
URIm2://54BD10ZZDN
Kinddefinition
WritingW0 stub
MSC41A40, 41A35, 41A36
DefinesSaturation of approximation methods
UsesBanach space, Continuous linear map, Big O notation

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.