On the Newton iteration in the application of collocation methods to implicit delay equations

Abstract

We consider stiffly accurate collocation methods based on Radau nodes for the integration of initial value problems for implicit delay differential equations of the form M y ′ ( t ) = f ( t , y ( t ) , y ( α 1 ( t , y ( t ) ) ) , … , y ( α p ( t , y ( t ) ) ) ) , where M is a constant matrix and α i ( t , y ( t ) ) ( i = 1 , … , p ) denote the deviating arguments, which are assumed to satisfy the inequalities α i ( t , y ( t ) ) ⩽ t for all i. In a recent paper [Computing 67 (2001) 1–12] we have described how collocation methods based on Radau nodes can be applied to solve problems of this type. The aim of this paper is that of explaining the difficulties arising when solving the Runge–Kutta equations using stepsizes larger than delays and to design techniques able to efficiently overcome them.