The Remez algorithm is a numerical method used to find the best uniform approximation of a continuous function by a polynomial. It is particularly useful in the context of Chebyshev approximations and is a technique for minimizing the maximum deviation (error) between a function and its polynomial approximation. The algorithm is named after the Russian mathematician Evgeny Remez.
Articles by others on the same topic
There are currently no matching articles.