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 06:03, 6 June 2006 (cleanup using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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