Approximations and expansions Rates of approximation: direct and inverse theorems Concept
Saturation of approximation methods
Summary
Many linear approximation methods cannot converge faster than a certain rate, except for a small class of trivial functions. This phenomenon is called saturation, and that rate is the saturation order of the method. The functions approximated with exactly this rate form the saturation class. Saturation explains why smoothness beyond a certain level does not improve methods such as Bernstein polynomials or Fejér means.
Further reading
About this page
| Tag | 3QWJB8GHDE |
|---|---|
| URI | m2://3QWJB8GHDE |
| Kind | concept |
| Writing | W0 stub |
| MSC | 41A40, 41A35, 41A36 |
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.