Math 2.0

Approximations and expansions Best approximation and Chebyshev systems Concept

Minimax approximation

Summary

Fix a continuous function ff on an interval and a degree nn. A minimax approximation of ff is a polynomial pp of degree at most nn that makes the largest error max⁡∣f−p∣\max \abs{f - p} 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 sin⁡\sin, exp⁡\exp and other functions in software libraries.

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Minimax_approximation_algorithm
About this page
TagASWF03X5AM
URIm2://ASWF03X5AM
Kindconcept
WritingW0 stub
MSC41A50, 41A10, 65D15
SpecializesBest 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.

What links here

Definitions

Used by