Jump to content

Minimax approximation algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Disavian (talk | contribs) at 21:08, 24 April 2006 (created article). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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