Content deleted Content added
Gareth Jones (talk | contribs) add new lead with reference |
Gareth Jones (talk | contribs) wlink author, correct typo |
||
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>{{cite book | chapter = 7: The theory of minimax approximation | first = M. J. D. | last=
::<math>\max_{a \leq x \leq b}|f(x)-p(x)|.</math>
| |||