Math 2.0

Approximations and expansions Definition

Minimax approximation

Builds on Continuous functionIntervalDegree of a polynomial

Definition

Let a<ba < b be real numbers and let f ⁣:[a,b]→ℝf \colon [a, b] \to \R be a continuous function on the interval [a,b][a, b]. Let n≥0n \ge 0 be an integer and let 𝒫n\mathcal{P}_n be the set of real polynomials of degree at most nn. A minimax approximation of degree nn to ff is a polynomial p∗∈𝒫np^* \in \mathcal{P}_n such that max⁡a≤x≤b∣f(x)−p∗(x)∣=inf⁡p∈𝒫nmax⁡a≤x≤b∣f(x)−p(x)∣.\max_{a \le x \le b} \abs{f(x) - p^*(x)} = \inf_{p \in \mathcal{P}_n} \max_{a \le x \le b} \abs{f(x) - p(x)}. The common value is the minimax error En(f)E_n(f).

Remarks

Example: for f(x)=x2f(x) = x^2 on [−1,1][-1, 1] and n=1n = 1, the polynomial p∗(x)=1/2p^*(x) = 1/2 is the minimax approximation, with error 1/21/2. Check: x2−1/2x^2 - 1/2 takes the values 1/2,−1/2,1/21/2, -1/2, 1/2 at x=−1,0,1x = -1, 0, 1. If a line pp had ∣x2−p(x)∣<1/2\abs{x^2 - p(x)} < 1/2 everywhere, then p(−1)>1/2p(-1) > 1/2, p(0)<1/2p(0) < 1/2 and p(1)>1/2p(1) > 1/2, which no linear function can do, since p(0)p(0) is the mean of p(−1)p(-1) and p(1)p(1).

Non-example: the Taylor polynomial 1+x1 + x of exe^x at 00 is not the minimax approximation of degree 11 on [−1,1][-1, 1]. Its error ex−1−xe^x - 1 - x is never negative, so lowering the line a little makes the largest error smaller.

A minimax approximation exists and is unique for every continuous ff. It is characterised by equioscillation: the error f−p∗f - p^* attains its largest absolute value at n+2n + 2 points with alternating signs. In terms of norms, p∗p^* minimises ∥f−p∥∞\norm{f - p}_\infty over 𝒫n\mathcal{P}_n, where ∥g∥∞=max⁡[a,b]∣g∣\norm{g}_\infty = \max_{[a, b]} \abs{g}.

Reading path

To understand this page from the ground up, read these 15 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Construction of the reals from Cauchy sequences concept
  2. Continuous function concept
  3. Group concept
  4. Integers object
  5. Ordered field definition
  6. Rational numbers object
  7. Ring definition
  8. Ring of integers statement
  9. Polynomial ring definition
  10. The rationals form a field statement
  11. Degree of a polynomial definition
  12. The rationals form an ordered field statement
  13. Order on the reals definition
  14. Interval definition
  15. Minimax approximation definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Minimax_approximation_algorithm
About this page
TagNABGFH3WS1
URIm2://NABGFH3WS1
Kinddefinition
WritingW0 stub
MSC41A50, 41A10, 65D15
DefinesMinimax approximation
UsesContinuous function, Interval, Degree of a polynomial

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

No page links to this page yet.