High Quality Content by WIKIPEDIA articles! The Remez algorithm (sometimes also called Remes algorithm, Remez/Remes exchange algorithm, or simply Exchange algorithm), published by Evgeny Yakovlevich Remez in 1934 is an iterative algorithm used to find simple approximations to functions, specifically, approximations by functions in the Chebyshev space which are the best in the uniform norm L? sense. A typical example of a Chebyshev space is the subspace of polynomials of order n in the space of real continuous functions on an interval, C[a, b]. The polynomial of best approximation within a given subspace is defined to be the one that minimizes the maximum absolute difference between the polynomial and the function.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.