Equioscillation theorem

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.

Statement

Let $f$ be a continuous function from $[a,b]$ to $\mathbf {R}$. Among all the polynomials of degree $\leq n$, the polynomial $g$ minimizes the uniform norm of the difference ${\displaystyle ||f-g||_{\infty }}$ if and only if there are $n+2$ points ${\displaystyle a\leq x_{0}<x_{1}<\cdots <x_{n+1}\leq b}$ such that ${\displaystyle f(x_{i})-g(x_{i})=\sigma (-1)^{i}||f-g||_{\infty }}$ where ${\displaystyle \sigma =\pm 1}$.

Algorithms

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

References

• Notes on how to prove Chebyshev’s equioscillation theorem at the Wayback Machine (archived July 2, 2011)
• The Chebyshev Equioscillation Theorem by Robert Mayans