Analysis of Stepsize Selection Schemes for Runge-Kutta Codes

Abstract

Conditions on Runge-Kutta algorithms can be obtained which ensure smooth stepsize selection when stability of the algorithm is restricting the stepsize. Some recently derived results are shown to hold for a more general test problem.