Comparison between Borel-Padé summation and factorial series, as time integration methods (Q321638): Difference between revisions

The authors aim at comparing the Borel-Padé algorithm to one based on generalized factorial series (GFS) for the numerical solution of ODEs. The goal is to examine robustness of these algorithms for a ``blind'' use. In Section 2, the Gevrey asymptotics theory and the Borel summation method are briefly recalled. Then the Borel-Padé algorithm is illustrated. In Section 3, the Borel-Padé algorithm's weak points are analysed. In Section 4, the generalized factorial series algorithm, which avoids the computation of a Padé approximant, is presented. In Section 5, the authors numerically compare the generalized factorial series algorithm with the Borel-Padé procedure. In the last section, some other numerical experiments are presented.