Approximations and expansions Definition
Saturation of approximation methods
Definition
Let be a Banach space and let , , be continuous linear maps. Let with . The sequence is saturated with saturation order if both conditions hold.
- If and , then for all .
- Some with for some satisfies .
The saturation class is the set of with , in big O notation.
Remarks
Example: the Bernstein operators on with the uniform norm are saturated with order . For one has , so , which is but not . The only with are the linear functions, which reproduces.
Non-example: the Fourier partial sum operators on of the circle are not saturated for any order. A trigonometric polynomial of degree has for , so , but , so clause 1 fails.
The Fejér means of Fourier series are saturated with order in of the circle, and only constants are approximated with error . 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
- no evidence level
- Banach space concept
- Big O notation concept
- Continuous linear map concept
- Saturation of approximation methods definition
Further reading
About this page
| Tag | 54BD10ZZDN |
|---|---|
| URI | m2://54BD10ZZDN |
| Kind | definition |
| Writing | W0 stub |
| MSC | 41A40, 41A35, 41A36 |
| Defines | Saturation of approximation methods |
| Uses | Banach 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.