Minimax approximation algorithm: Difference between revisions

Revision as of 13:44, 12 May 2010

Revision as of 18:57, 29 March 2011

Line 1:

{{Context|date=October 2009}}

Polynomial expansions such as the [[taylorTaylor 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.

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