A New Integration Algorithm for Ordinary Differential Equations Based on Continued Fraction Approximations

14Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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. © 1974, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Willers, I. M. (1974). A New Integration Algorithm for Ordinary Differential Equations Based on Continued Fraction Approximations. Communications of the ACM, 17(9), 504–508. https://doi.org/10.1145/361147.361150

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free