Remez Algorithm Applied to the Best Uniform Polynomial Approximations

In this paper, we show the uniqueness of polynomial of best approximation of a function f ∈ E = C^0 ([a, b]) by a polynomial of degree ≤ n and to characterize it. Then introduce the algorithm of Remez and prove its convergence. Illustrations and numerical simulations are given to prove the efficiency of our work.