Abstract
A new approach to generalized Pade approximants is presented. Its main interest lies in the fact that it avoids instability and/or round-off errors which occur in traditional algorithms for evaluating Pade approximants. Moreover, the approximants are readily obtained. Applications concerned with the tabulation of some transcendental functions in their critical domain (Weber and Bessel functions) illustrate the power of the method.
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.
