A new integration algorithm for ordinary differential equations based on continued fraction approximations
- 1 September 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 17 (9) , 504-508
- https://doi.org/10.1145/361147.361150
Abstract
A new integration algorithm is found, and an implementation is compared with other programmed algorithms. The new algorithm is a step-by-step procedure for solving the initial value problem in ordinary differential equations. It is designed to approximate poles of small integer order in the solutions of the differential equations by continued fractions obtained by manipulating the sums of truncated Taylor series expansions. The new method is compared with the Gragg-Bulirsch-Stoer, and the Taylor series method. The Taylor series method and the new method are shown to be superior in speed and accuracy, while the new method is shown to be most superior when the solution is required near a singularity. The new method can finally be seen to pass automatically through singularities where all the other methods which are discussed will have failed.Keywords
This publication has 3 references indexed in Scilit:
- Comparing Numerical Methods for Ordinary Differential EquationsSIAM Journal on Numerical Analysis, 1972
- Numerical treatment of ordinary differential equations by extrapolation methodsNumerische Mathematik, 1966
- Non‐linear Transformations of Divergent and Slowly Convergent SequencesJournal of Mathematics and Physics, 1955