Approximations and expansions Best approximation and Chebyshev systems Concept
Minimax approximation
Summary
Fix a continuous function on an interval and a degree . A minimax approximation of is a polynomial of degree at most that makes the largest error as small as possible. It is the best approximation for the uniform norm, so it controls the error at every point and not only on average. Minimax polynomials are used to build the routines that compute , and other functions in software libraries.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | ASWF03X5AM |
|---|---|
| URI | m2://ASWF03X5AM |
| Kind | concept |
| Writing | W0 stub |
| MSC | 41A50, 41A10, 65D15 |
| Specializes | Best approximation |
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.