EN
Consider the class of Bobkov methods for solving the IVP: y′=f(x,y), x[a,b]. Four procedures for finding the step size h are presented. It is shown that these Bobkov methods with automatic stepsize control are faster (i.e. need fewer evaluations of f) than the corresponding Runge-Kutta methods.