Jump to content

Minimax approximation algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Amalas (talk | contribs) at 21:34, 24 April 2006 (Stub-sorting. You can help!). 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.