Equioscillation theorem

From HandWiki
Revision as of 07:55, 27 June 2023 by Len Stevenson (talk | contribs) (change)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Short description: Theorem

In mathematics, the equioscillation theorem concerns the approximation of continuous functions using polynomials when the merit function is the maximum difference (uniform norm). Its discovery is attributed to Chebyshev.[1]

Statement

Let [math]\displaystyle{ f }[/math] be a continuous function from [math]\displaystyle{ [a,b] }[/math] to [math]\displaystyle{ \mathbb{R} }[/math]. Among all the polynomials of degree [math]\displaystyle{ \le n }[/math], the polynomial [math]\displaystyle{ g }[/math] minimizes the uniform norm of the difference [math]\displaystyle{ \| f - g \| _\infty }[/math] if and only if there are [math]\displaystyle{ n+2 }[/math] points [math]\displaystyle{ a \le x_0 \lt x_1 \lt \cdots \lt x_{n+1} \le b }[/math] such that [math]\displaystyle{ f(x_i) - g(x_i) = \sigma (-1)^i \| f - g \|_\infty }[/math] where [math]\displaystyle{ \sigma }[/math] is either -1 or +1.[1][2]

Variants

The equioscillation theorem is also valid when polynomials are replaced by rational functions: among all rational functions whose numerator has degree [math]\displaystyle{ \le n }[/math] and denominator has degree [math]\displaystyle{ \le m }[/math], the rational function [math]\displaystyle{ g = p/q }[/math], with [math]\displaystyle{ p }[/math] and [math]\displaystyle{ q }[/math] being relatively prime polynomials of degree [math]\displaystyle{ n-\nu }[/math] and [math]\displaystyle{ m-\mu }[/math], minimizes the uniform norm of the difference [math]\displaystyle{ \| f - g \| _\infty }[/math] if and only if there are [math]\displaystyle{ m + n + 2 - \min\{\mu,\nu\} }[/math] points [math]\displaystyle{ a \le x_0 \lt x_1 \lt \cdots \lt x_{n+1} \le b }[/math] such that [math]\displaystyle{ f(x_i) - g(x_i) = \sigma (-1)^i \| f - g \|_\infty }[/math] where [math]\displaystyle{ \sigma }[/math] is either -1 or +1.[1]

Algorithms

Several minimax approximation algorithms are available, the most common being the Remez algorithm.

References

External links