Revision as of 12:07, 8 October 2006 edit Pftupper (talk \| contribs) 70 edits Previous article was copied from mathworld and was hard to understand. ← Previous edit		Revision as of 12:11, 8 October 2006 edit undo Pftupper (talk \| contribs) 70 edits defined polynomial of best approximation Next edit →
Line 1: The '''Remez algorithm''' (Remez 1934), also called the '''Remez exchange algorithm''', is an iterative algorithm that finds the polynomial of best approximation of a given degre to a real function on an interval. The polynomial of best approximation of a given degree is defined to be the one that minimizes the maximum absolute difference between the polynomial and the function. ==External links==

Remez algorithm: Difference between revisions