Open issues in devising software for the numerical solution of implicit delay differential equations

We consider initial value problems for systems of implicit delay differential equations of the form My ′ ( t ) = f ( t , y ( t ) , y ( α 1 ( t , y ( t ) ) ) , … , y ( α m ( t , y ( t ) ) ) ) , where M is a constant square matrix (with arbitrary rank) and α i ( t , y ( t ) ) ⩽ t for all t and i. numerical treatment of this kind of problems, a software tool has been recently developed [6]; this code is called RADAR5 and is based on a suitable extension to delay equations of the 3-stage Radau IIA Runge–Kutta method. m of this work is that of illustrating some important topics which are being investigated in order to increase the efficiency of the code. They are mainly relevant to(i) ror control strategies in relation to derivative discontinuities arising in the solutions of delay equations; tegration of problems with unbounded delays (like the pantograph equation); plications to problems with special structure (as those arising from spatial discretization of evolutions PDEs with delays). l numerical examples will also be shown in order to illustrate some of the topics discussed in the paper.