The '''Remez algorithm''' (Remez 1934), also called the '''Remez exchange algorithm''', is an applicationiterative of the [[Chebyshev alternation theorem]]algorithm that constructsfinds the polynomial of best approximation to certaina functionsreal underfunction aon numberan of conditionsinterval. TheRemez algorithm in effect goes a step beyond the [[minimax approximation algorithm]] to give a slightly finer solution to an approximation problem.
Parks and [[James H. McClellan|McClellan]] (1972) observed that a filter of a given length with minimal ripple would have a response with the same relationship to the ideal filter that a polynomial of degree ≤ ''n'' of best approximation has to a certain function, and so the Remez algorithm could be used to generate the coefficients.
