Skip Navigation

The Computer Journal 1964 7(3):246-248; doi:10.1093/comjnl/7.3.246
© 1964 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (12)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Scraton, R. E.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Estimation of the truncation error in Runge-Kutta and allied processes

R. E. Scraton *

Northampton College of Advanced Technology, St Johns Street, London, UK

Methods for estimating the truncation error in processes of the Runge-Kutta type are divided into two categories; those which make use of the data of several consecutive steps, and those which use the data of a single stop only. Existing methods of both forms are discussed, and some new methods are suggested.


* Northampton College of Advanced Technology, St. Johns St., London E.C.1.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 SIMULATIONHome page
A.S. Chai
A fifth-order modified Runge-Kutta integration algorithm
SIMULATION, January 1, 1972; 18(1): 21 - 27.
[PDF]

Home page
 SIMULATIONHome page
G. H. Burgin
Comment on the Runge-Kutta-Merson Algorithm
SIMULATION, August 1, 1970; 15(2): 89 - 91.
[PDF]

Home page
 SIMULATIONHome page
A.S. Chai
A modified Runge-Kutta method
SIMULATION, May 1, 1968; 10(5): 221 - 223.
[Abstract] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.