Abstract
A method is presented for developing Runge-Kutta integration algorithms with built-in estimates of the accumulated truncation error. Several new 2-nd, 3-rd, and 4-th order algorithms are given. The computation per step of the new algorithms is identical to that of algorithms which provide only an estimate of the local truncation error. Numerical experimentation with the new algorithms shows that the estimated error compares very well with the true accumulated error. Further, the error is of the same order as that incurred using traditional Runge-Kutta algorithms.
Zusammenfassung
Es wird eine Methode für die Entwicklung von Runge-Kutta-Integrationsalgorithmen angegeben, die die Schätzung des globalen Verfahrensfehlers ermöglichen. Mehrere neue Algorithmen 2., 3. und 4. Ordnung werden angeführt. Die Rechenarbeit pro Schritt ist identisch für die neuen Algorithmen und für Algorithmen, die nur eine Schätzung des lokalen Verfahrensfehlers ermöglichen. Numerische Versuche mit den neuen Algorithmen ergeben, daß der geschätzte Fehler den wahren akkumulierten Fehler gut wiedergibt. Außerdem ist der Fehler von derselben Ordnung wie bei gewöhnlichen Runge-Kutta-Algorithmen.
Similar content being viewed by others
References
Butcher, J. C.: Coefficients for The Study of Runge-Kutta Integration Processes. Journal of Australian Math. Sci.3, 185–201 (1963).
Butcher, J. C.: The Effective Order of Runge-Kutta Methods (Lecture Notes in Math., Vol. 109), pp. 133–139. Berlin-Heidelberg-New York: Springer 1969.
Conte, S. D.: The Numerical Solution of Linear Boundary Value Problems. SIAM Review8, 309–321 (1966).
Factor, R.: Techniques for the efficient automatic solution of stiff initial value problems. Ph. D. Thesis, Case Western Reserve University, 1971.
Fehlberg, E.: Classical 5th, 6th, 7th, and 8th order Runge-Kutta formulas with stepsize control. NASA Tech. Rpt., NASA TR R-287 (1968).
Fehlberg, E.: Low order classical Runge-Kutta formulas with stepsize control. NASA Tech. Rpt., M-256 (1969).
Gragg, W.: Repeated extrapolation to the limit in the numerical solution of ordinary differential equations. Ph. D. Dissertation, UCLA, 1963.
Henrici, P.: Discrete Variable Methods in Ordinary Differential Equations. Wiley 1962.
IBM Corporation: Continuous System Modeling Program III (CSMP III), Program Reference Manual, Second Edition, 1972.
Lapidus, L., Seinfeld, J. H.: Numerical Solution of Ordinary Differential Equations, Chapter 2. Academic Press 1971.
Lapidus, L., Seinfeld, J. H.: Numerical Solution of Ordinary Differential Equations, Chapter 5. Academic Press 1971.
Merluzzi, P. J.: A new class of Runge-Kutta integration processes, with improved error estimates, for automatic simulation. Ph. D. Thesis, Case Western Reserve University, 1974.
Merson, R. H.: An operational method for study of integration processes. Proc. of Symp. on Data Processing, Weapons Research Establishment, Salisbury, Australia, 1957.
MIMIC: A digital simulator program. Sesca Internal Memo.65, 12 (1965).
Pereyra, V.: On improving an approximate solution of a functional equation by deferred corrections. Numer. Math.1966, 376–391.
Sarafyan, D.: Estimation of errors for the approximate solution of differential equations and their systems. L.S.U. Tech. Rpt.15 (1966).
Shampine, L. F.: Local extrapolation in the solution of ordinary differential equations. Math. of Comput.27, 91–97 (1973).
Stetter, H. J.: Asymptotic expansions for the error of discretization algorithms for nonlinear functional equations. Numer. Math.7, 18–31 (1965).
Stetter, H. J.: Local Estimation of the Global Discretization Error. SIAM J. Numer. Anal.8 (1971).
Stetter, H. J.: Analysis of Discretization Methods for Ordinary Differential Equations (Springer Tracts in Natural Philosophy, Vol. 23). Berlin-Heidelberg-New York: Springer 1973.
Zonneveld, J. A.: Automatic Numerical Integration (Math. Centre Tracts, Vol. 8). Amsterdam: Mathematisch Centrum 1964.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Merluzzi, P., Brosilow, C. Runge-Kutta integration algorithms with built-in estimates of the accumulated truncation error. Computing 20, 1–16 (1978). https://doi.org/10.1007/BF02241897
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02241897