Minimax approximation algorithm

From Wikipedia, the free encyclopedia
Jump to: navigation, search

A minimax approximation algorithm (or L approximation[1] or uniform approximation[2]) is a method to find an approximation of a mathematical function that minimizes maximum error.

For example, given a function f defined on the interval [a,b] and a degree bound n, a minimax polynomial approximation algorithm will find a polynomial p of degree at most n to minimize[3]

\max_{a \leq x \leq b}|f(x)-p(x)|.

Polynomial approximations[edit]

The Weierstrass approximation theorem states that every continuous function defined on a closed interval [a,b] can be uniformly approximated as closely as desired by a polynomial function.[2] For practical work it is often desirable to minimize the maximum absolute or relative error of a polynomial fit for any given number of terms in an effort to reduce computational expense of repeated evaluation.

Polynomial expansions such as the Taylor series expansion are often convenient for theoretical work but less useful for practical applications. Truncated Chebyshev series, however, closely approximate the minimax polynomial.

One popular minimax approximation algorithm is the Remez algorithm.

External links[edit]

References[edit]

  1. ^ Muller, Jean-Michel et al. (2009). Handbook of Floating-Point Arithmetic. Springer. p. 376. ISBN 081764704X. 
  2. ^ a b Phillips, George M. (2003). "Interpolation and Approximation by Polynomials". CMS Books in Mathematics. Springer. pp. 49–11. doi:10.1007/0-387-21682-0_2. ISBN 0-387-00215-4.  |chapter= ignored (help) edit
  3. ^ Powell, M. J. D. (1981). "7: The theory of minimax approximation". Approximation Theory and Methods. Cambridge University Press. ISBN 0521295149.