×

zbMATH — the first resource for mathematics

RK-slim: embedded Runge-Kutta without the excess baggage. (English) Zbl 1242.65140
Summary: Computationally demanding scientific simulations require numerical integration of large systems of ordinary differential equations (ODEs) in real time. Runge-Kutta (RK) methods with step-size control are frequently employed because they are accurate and have short execution times. Computational step sizes can be increased while maintaining accuracy if the error generated during each time step is below a predetermined threshold. However, if the error exceeds the threshold, the time step must be re-computed using a smaller step-size. In practice, the re-computation is unnecessary for most equations in the system because violations of the error tolerance are localized and occur in just a few equations. We present an efficient and accurate method for solving ODEs that exploits these observations on step-size by eliminating many unnecessary computations in embedded RK methods. We demonstrate how our new method can be a valuable tool for practitioners in the field through simulations with real-world data.
MSC:
65L06 Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations
Software:
dverk; nag; NSDTST; Octave; STDTST
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Hairer, Solving Ordinary Differential Equations I: Nonstiff Problems (1993) · Zbl 0789.65048
[2] Press, Numerical Recipes in C (1992)
[3] http://www.mathworks.com/
[4] http://www.mathworks.com/products/simulink/
[5] Brankin R Gladwell I RKSUITE 90. NAG Fortran 90 library 1997
[6] Hull T Enright W Jackson K User’s guide for DVERK 1976
[7] Eaton, GNU Octave Manual (2002)
[8] Korch, Optimizing locality and scalability of embedded Runge-Kutta solvers using block-based pipelining, Journal of Parallel Distributed Computing 66 (3) pp 444– (2006) · Zbl 1090.65090 · doi:10.1016/j.jpdc.2005.09.003
[9] Elmqvist H Mattsson SE Olsson H Andreasson J Otter M Schweiger C Brück D 2004 http://elib.dlr.de/12173/
[10] https://engineering.purdue.edu/AAE/Academics/Courses/aae450/2008/spring/6_traj/version_5.4 2010
[11] Enright, Two FORTRAN packages for assessing initial value methods, ACM Transactions on Mathematical Software 13 (1) pp 1– (1987) · Zbl 0617.65069 · doi:10.1145/23002.27645
[12] Enright, Interpolants for Runge-Kutta formulas, ACM Transactions on Mathematical Software 12 (3) pp 193– (1986) · Zbl 0617.65068 · doi:10.1145/7921.7923
[13] Tsitouras, New interpolants for Runge-Kutta algorithms using second derivatives, International Journal of Computer Mathematics 31 pp 105– (1989) · Zbl 0749.65051 · doi:10.1080/00207168908803792
[14] Kennedy, Optimizing Compilers for Modern Architectures (2002)
[15] Muchnick, Advanced Compiler Design and Implementation (1997)
[16] Mazzia F Magherini C http://pitagora.dm.uniba.it/ 2008
[17] Rice, Approximate model of cooperative activation and crossbridge cycling in cardiac muscle using ordinary differential equations, Biophysical Journal 95 pp 2368– (2008) · doi:10.1529/biophysj.107.119487
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.