Remez algorithm
The Remez algorithm or Remez 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 a Chebyshev space that are the best in the uniform norm "L"∞ sense.

A typical example of a Chebyshev space is the subspace of Chebyshev 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. In this case, the form of the solution is precised by the equioscillation theorem.
Q919074
Evgeny Yakovlevich Remez
PER
Q1566432
Chebyshev space
MISC
Q1202673
uniform norm
Concept
Q619511
Chebyshev polynomials
Concept
Q125977
space
Concept
Q170058
continuous function
Concept
Q185148
interval
Concept
Q1773230
absolute difference
Concept
Q5384549
equioscillation theorem
Concept
Q2835816
Remez algorithm
Concept
1934-01-01T00:00:00Z^^http://www.w3.org/2001/XMLSchema#dateTime
1934
DATE
named after
notable work