Adaptive mesh point selection for the efficient solution of scalar IVPs (Q679699)

The author considers an adaptive mesh point selection for the solution to scalar initial value problem for autonomous ordinary differential equation of the first order \[ z'(t) = f(z(t)),\quad t \in [a,b],\quad z(a) = \eta , \] where \(f:\mathbb{R} \to \mathbb{R}\) is a \({C^r}\)-function and \(\eta \in \mathbb{R}\). He proposes a method that is optimal in the sense of the speed of convergence, and strive to minimize the local errors. The author shows that the factor in the error expression can be significantly reduced. It is obtained formulas specifying the gain achieved in terms of the number of discretization subintervals, as well as in terms of the prescribed level of the local error. Both nonconstructive and constructive versions of the adaptive mesh selection are shown. The method is implemented in the algorithm ADMESH. A numerical example is given.