Applications of root finding methods for discrete rational Chebyshev approximation

Abstract

Root finding algorithms are shown to be applicable for finding best rational Chebyshev approximations over finite point sets when the denominator of the approximating function is bounded below by a positive constant. The methods are applicable to approximation in several variables and are shown to be competitive with the differential correction algorithm.