Math 2.0

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

  1. Web https://en.wikipedia.org/wiki/Jackson%27s_inequality
About this page
TagTDKKST5AWA
URIm2://TDKKST5AWA
Kindconcept
WritingW0 stub
MSC41A25, 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

Definitions