Minimax approximation algorithm: Difference between revisions

Revision as of 18:41, 1 April 2008

Revision as of 05:44, 12 April 2008

Line 1:

{{context}}

Polynomial expansions such as the [[taylor series]] expansion are often convenient for theoretical work but less useful for practical applications. 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.

The '''Minimax approximation algorithm''' is a minimization [[algorithm]] of the maximum error for a fixed number of terms.

Algorithms that minimize the maximum error are known as '''Minimax approximation algorithms'''. One popular approach is the [remez algorithm].

==External links==