Approximations and expansions Rates of approximation: direct and inverse theorems Concept
Direct and inverse theorems of approximation
Summary
Direct and inverse theorems are the two halves of the link between the smoothness of a function and how fast it can be approximated. A direct theorem, of Jackson type, says that smooth functions have small errors of best approximation. An inverse theorem, of Bernstein type, says that small errors of best approximation force smoothness. Together they often characterise a smoothness class exactly by the rate of approximation.
Further reading
About this page
| Tag | TDKKST5AWA |
|---|---|
| URI | m2://TDKKST5AWA |
| Kind | concept |
| Writing | W0 stub |
| MSC | 41A25, 41A27, 42A10 |
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
Results about this
- Bernstein's theorem on analytic functions
- Bernstein's theorem on inverse approximation
- Jackson's inequality