Content deleted Content added
Gareth Jones (talk | contribs) wlink author, correct typo |
Gareth Jones (talk | contribs) section for polynomial approximations |
||
Line 1:
{{unreferenced|date=August 2012}}
{{Context|date=October 2009}}
A '''minimax approximation algorithm''' is a method which aims to find an approximation such that the maximum error is minimized. Suppose we seek to approximate the function f(''x'') by a function p(''x'') on the interval [''a'',''b'']. Then a minimax approximation algorithm will aim to minimize<ref name="powell">{{cite book | chapter = 7: The theory of minimax approximation | first = M. J. D. | last= Powell | authorlink=Michael J. D. Powell | year = 1981 | publisher= Cambridge University Press | title = Approximation Theory and Methods | isbn = 0521295149}}</ref>
::<math>\max_{a \leq x \leq b}|f(x)-p(x)|.</math>
==Polynomial approximations==
The conditions for a best appromation are particularly simple if the function p(''x'') is restricted to polynomials less than a stated degree ''n''.<ref name="powell" />
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.
One popular
==External links==
| |||