1951
DOI: 10.1017/s0305004100026414
|View full text |Cite
|
Sign up to set email alerts
|

A process for the step-by-step integration of differential equations in an automatic digital computing machine

Abstract: It is advantageous in automatic computers to employ methods of integration which do not require preceding function values to be known. From a general theory given by Kutta, one such process is chosen giving fourth-order accuracy and requiring the minimum number of storage registers. It is developed into a form which gives the highest attainable accuracy and can be carried out by comparatively few instructions. The errors are studied and a simple example is given.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

1
131
0
1

Year Published

1960
1960
2016
2016

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 419 publications
(133 citation statements)
references
References 0 publications
1
131
0
1
Order By: Relevance
“…However, it will now be shown, following Gill [1], that it is slightly better to let Pn -(-L¡-) P,2, \a -n + r) \ a -n + r/ \a -n + r)…”
Section: Ia -P 4-s 4-t)e'iqn) = -Eiziz)mentioning
confidence: 96%
See 1 more Smart Citation
“…However, it will now be shown, following Gill [1], that it is slightly better to let Pn -(-L¡-) P,2, \a -n + r) \ a -n + r/ \a -n + r)…”
Section: Ia -P 4-s 4-t)e'iqn) = -Eiziz)mentioning
confidence: 96%
“…Gill [1] and Blum [2] have produced special versions of the Runge-Kutta fourth order method for the solution of N simultaneous first order differential equations which require 3A 4-P storage locations against the normal 4JV -f P, where P is the storage required by the program. It is shown below that it is possible to arrange all such methods in a form which requires SN -\-P storage locations.…”
mentioning
confidence: 99%
“…Although we have not yet found an analytical proof, the numerical result very strongly suggests that in which the generating integrals were evaluated by Gill's method [7]. Various step sizes were tried and the results were checked against standard tables [8].…”
mentioning
confidence: 99%
“…We now let y be the vector, (ya, yi, ■ ■ • , yn), and / the vector-valued function, (/0, /i , • • • , /"). The initial value problem can then be written as (1)(2)(3) y'=f(y), (1.4) y(k) = a.…”
mentioning
confidence: 99%
“…A variant of this method was derived by S. Gill [1]. The two advantages of Gill's variant are (1) in automatic computers, it requires 'in -4-B storage registers whereas the Runge-Kutta formulas as given above, require An -f-B, where B is some constant; (2) the computation can be arranged so that rounding errors are reduced appreciably.…”
mentioning
confidence: 99%