Remez algorithm
Algorithm to approximate functions
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. It is sometimes referred to as Remes algorithm or Reme algorithm.
Nº Q2835816 ★
Common · Knowledge
Remez algorithm
Algorithm to approximate functions
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. It is sometimes referred to as Remes algorithm or Reme algorithm.
From Wikipedia
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. It is sometimes referred to as Remes algorithm or Reme algorithm. 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.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Chebyshev nodes
Real algebraic numbers, roots of the Chebyshev polynomials of the first kind
Nº Q1052508 ★
Not listed
-
S
Stone–Weierstrass theorem
Theorem that every continuous function on a compact Hausdorff space can be approximated by certain families of continuous functions
Nº Q939927 ★★
Not listed
-
W
WKB approximation
Method for finding approximate solutions to linear differential equations with spatially varying coefficients
Nº Q907306 ★★
Not listed
-
L
Linearization
Finding linear approximation of function at given point
Nº Q1520713 ★
Not listed
-
H
Horner's method
Algorithm for polynomial evaluation
Nº Q944658 ★★
Not listed
-
R
Rvachev function
Real-valued mathematical function
Nº Q4047790 ★
Not listed