Abstract
An algorithm for constrained rational Chebyshev approximation is introduced that combines the idea of an algorithm due to Hettich and Zencke, for which superlinear convergence is guaranteed, with the auxiliary problem used in the well-known original differential correction method. Superlinear convergence of the algorithm is proved. Numerical examples illustrate the fast convergence of the method and its advantages compared with the algorithm of Hettich and Zencke.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have