Abstract
We compare the performance of two algorithms of computing the Borel sum of a time power series. The first one uses Pade approximants in Borel space, followed by a Laplace transform. The second is based on factorial series. These algorithms are incorporated in a numerical scheme for time integration of differential equations.
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 callMore From: Discrete and Continuous Dynamical Systems - Series S
Disclaimer: 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.
