Wikipedia

Remez algorithm

This is an old revision of this page, as edited by Pftupper (talk | contribs) at 12:07, 8 October 2006 (Previous article was copied from mathworld and was hard to understand.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Remez algorithm (Remez 1934), also called the Remez exchange algorithm, is an iterative algorithm that finds the polynomial of best approximation to a real function on an interval.


 

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Remez_algorithm&oldid=80195492"