NUMERICAL ALGORITHM FOR MINIMAX POLYNOMIAL APPROXIMATION OF FUNCTIONS WITH A GIVEN WEIGHT

The article discusses a rapidly converging numerical algorithm for determining the coefficients of polynomials. The algorithm provides the optimal approximation of a given function in the minimax norm with a given weight on a given interval. The approximation is made under the condition that the weight function does not turn to zero on the considered interval, except, perhaps, for the initial and/or final points of the interval.