The Newton differential correction algorithm for rational Chebyshev approximation with constrained denominators (Q2564503): Difference between revisions

\textit{E. H. Kaufman jun.} and \textit{G. D. Taylor} [J. Approximation Theory 32, 9-26 (1981; Zbl 0472.41015)] studied an algorithm for the computation of best rational approximations which satisfy constraints on the denominators. The algorithm is reconsidered and combined with an algorithm of \textit{R. Hettich} and \textit{P. Zencke} [SIAM J. Numer. Anal. 27, No. 4, 1024-1033 (1990; Zbl 0706.65003)]. Numerical examples illustrate the fast convergence of the method and its advantages compared with the algorithm of Hettich and Zencke.