P-stability properties of runge-kutta methods for delay differential equations
Numerische Mathematik
Applied Numerical Mathematics
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Open issues in devising software for the numerical solution of implicit delay differential equations
Journal of Computational and Applied Mathematics - Special issue: International workshop on the technological aspects of mathematics
Delay-differential-algebraic equations in control theory
Applied Numerical Mathematics - The third international conference on the numerical solutions of volterra and delay equations, May 2004, Tempe, AZ
On the Newton iteration in the application of collocation methods to implicit delay equations
Applied Numerical Mathematics - Tenth seminar on and differential-algebraic equations (NUMDIFF-10)
Solving neutral delay differential equations with state-dependent delays
Journal of Computational and Applied Mathematics
On the Newton iteration in the application of collocation methods to implicit delay equations
Applied Numerical Mathematics
Delay-differential-algebraic equations in control theory
Applied Numerical Mathematics
Open issues in devising software for the numerical solution of implicit delay differential equations
Journal of Computational and Applied Mathematics - Special issue: International workshop on the technological aspects of mathematics
The stability of radau IIA collocation processes for delay differential equations
Mathematical and Computer Modelling: An International Journal
Mathematics and Computers in Simulation
Original article: Numerical computation of derivatives in systems of delay differential equations
Mathematics and Computers in Simulation
Hi-index | 0.00 |
This article discusses the numerical solution of a general class of delay differential equations, including stiff problems, differential-algebraic delay equations, and neutral problems. The delays can be state dependent, and they are allowed to become small and vanish during the integration. Difficulties encountered in the implementation of implicit Runge-Kutta methods are explained, and it is shown how they can be overcome. The performance of the resulting code - RADAR5 - is illustrated on several examples, and it is compared to existing programs.