Approximations and expansions Basic notions Concept
Error of best approximation
Summary
The error of best approximation of from a set is the distance from to , the infimum of over . For a function and the polynomials of degree at most it is written . It measures how well can be approximated at all, whether or not a best approximation exists. Its decay as reflects the smoothness of .
Where this leads
13 pages build on this one.
- n-term approximation
- Constructive function theory
- Multivariate approximation
- Bernstein's theorem on analytic functions
- Direct and inverse theorems of approximation
- Nonlinear approximation
- Bernstein's theorem on inverse approximation
- Favard's theorem on trigonometric approximation
- Approximation theory
- Equioscillation theorem
- Jackson's inequality
- De la Vallée Poussin lower bound
- Weighted polynomial approximation
Further reading
About this page
| Tag | YDN0T4MEX0 |
|---|---|
| URI | m2://YDN0T4MEX0 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 41A50, 41A25, 41A10 |
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
Used by
- n-term approximation
- Constructive function theory
- Multivariate approximation
- Bernstein's theorem on analytic functions
- Direct and inverse theorems of approximation
- Nonlinear approximation
- Bernstein's theorem on inverse approximation
- Favard's theorem on trigonometric approximation
- Approximation theory
- Equioscillation theorem
- Jackson's inequality
- De la Vallée Poussin lower bound
- Weighted polynomial approximation