Abstract
The aim of this work is the implementation of general algorithms for computing some generalized Pade-type approximants [1]. The quality of these approximants depends on the choice of some functionals. In the classical example of the seriesf(t)=log(1+t)/t we found functionals that give better results than the usual ones.
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.
