Applications of root finding methods for discrete rational Chebyshev approximation
DF McAllister, SM Pizer - Proceedings of the 18th annual Southeast …, 1980 - dl.acm.org
DF McAllister, SM Pizer
Proceedings of the 18th annual Southeast regional conference, 1980•dl.acm.orgRoot 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.
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.
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.
ACM Digital LibraryShowing the best result for this search. See all results