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
 | This mathematics-related article is a stub. You can help Wikipedia by expanding it. |