We consider the numerical solution of singular initial and terminal value problems using various low-order Runge-Kutta methods. With these basic solutions, we investigate the acceleration technique known as Iterated Defect Correction (IDeC). We show that the performance depends crucially on the asymptotic expansions of the global error. The results are compared with the asymptotic properties of extrapolation.