Interpolants for Runge-Kutta formulas
ACM Transactions on Mathematical Software (TOMS)
Two FORTRAN packages for assessing initial value methods
ACM Transactions on Mathematical Software (TOMS)
Analysis of error control strategies for continuous Runge-Kutta methods
SIAM Journal on Numerical Analysis
Robust defect control with Runge-Kutta schemes
SIAM Journal on Numerical Analysis
SIAM Journal on Numerical Analysis
Differentiable interpolants for high-order Runge-Kutta methods
SIAM Journal on Numerical Analysis
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
Rigorous shadowing of numerical solutions of ordinary differential equations by containment
Rigorous shadowing of numerical solutions of ordinary differential equations by containment
Numerical Methods
SIAM Journal on Scientific Computing
Algorithm 924: TIDES, a Taylor Series Integrator for Differential EquationS
ACM Transactions on Mathematical Software (TOMS)
Hi-index | 0.00 |
The quest for reliable integration of initial value problems (IVPs) for ordinary differential equations (ODEs) is a long-standing problem in numerical analysis. At one end of the reliability spectrum are fixed stepsize methods implemented using standard floating point, where the onus lies entirely with the user to ensure the stepsize chosen is adequate for the desired accuracy. At the other end of the reliability spectrum are rigorous interval-based methods, that can provide provably correct bounds on the error of a numerical solution. This rigour comes at a price, however: interval methods are generally two to three orders of magnitude more expensive than fixed stepsize floating-point methods. Along the spectrum between these two extremes lie various methods of different expense that estimate and control some measure of the local errors and adjust the stepsize accordingly. In this article, we continue previous investigations into a class of interpolants for use in Runge-Kutta methods that have a defect function whose qualitative behavior is asymptotically independent of the problem being integrated. In particular the point, in a step, where the maximum defect occurs as h → 0 is known a priori. This property allows the defect to be monitored and controlled in an efficient and robust manner even for modestly large stepsizes. Our interpolants also have a defect with the highest possible order given the constraints imposed by the order of the underlying discrete formula. We demonstrate the approach on three Runge-Kutta methods of orders 5, 6, and 8, and provide Fortran and preliminary Matlab interfaces to these three new integrators. We also consider how sensitive such methods are to roundoff errors. Numerical results for four problems on a range of accuracy requests are presented.