Jump to content

Minimax approximation algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Fabrictramp (talk | contribs) at 13:59, 20 June 2007 (Dead-end pages clean up project; you can help! 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 algorithm of the maximum error for a fixed number of terms.