Abstract
It is our contention that the recently developed Remes-difcor algorithm is the best general purpose algorithm available for computing best uniform rational approximations, and should be widely used as a library routine. The purpose of this paper is to support this contention by theoretical arguments and by a numerical comparison of the Remes-difcor algorithm, the differential correction algorithm, and the widely-used Remes algorithm. The Remes-difcor algorithm is shown to be more robust than the Remes algorithm and faster than the differential correction algorithm. The three algorithms are briefly described and discussed, and the experimental results for 70 examples are presented in six tables.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
