Computing breaking points in implicit delay differential equations (Q959999)

The authors are concerned with systems of implicit delay differential equations. The key aim of the paper is the computation of breaking points and the authors' approach is to give a detailed description of the differences between the approaches that can be used, and the results obtained, for delay differential equations, as compared to ordinary differential equations (ODEs). The paper is organised as follows: After a brief introduction, the authors focus on the ways in which Runge-Kutta methods are extended from methods for ODEs to apply to delay equations. As is well known, exact solutions of delay equations may not be smooth everywhere, and these breaking points need to be detected in the numerical schemes. These ideas are reviewed and a new algorithm is presented and discussed, in particular in relation to the ways in which breaking points are detected. Results show how the breaking point detected by the numerical scheme approximates the true breaking point of the underlying equation and the authors are able to give a new convergence result for the scheme. The paper concludes with some numerical experiments.