Difference methods for stiff delay differential equations

TL;DR: In this article, a computer code for stiff delay equations was developed using the BDF and the model equation y'(t) = py(t + qy(t-1), with complex p and q, with complex q = p + q y(t)-1.

Abstract: Delay differential equations of the form y'(t) = f(y(t), z(t)), where z(t) = (y/sub 1/(..cap alpha../sub 1/(y(t))),..., y/sub n/(..cap alpha../sub n/(y(t))))/sup T/ and ..cap alpha../sub i/(y(t)) less than or equal to t, arise in many scientific and engineering fields when transport lags and propagation times are physically significant in a dynamic process. Difference methods for approximating the solution of stiff delay systems require special stability properties that are generalizations of those employed for stiff ordinary differential equations. By use of the model equation y'(t) = py(t) + qy(t-1), with complex p and q, the definitions of A-stability, A( )-stability, and stiff stability have been generalize to delay equations. For linear multistep difference formulas, these properties extend directly from ordinary to delay equations. This straight forward extension is not true for implicit Runge-Kutta methods, as illustrated by the midpoint formula, which is A-stable for ordinary equations, but not for delay equations. A computer code for stiff delay equations was developed using the BDF. 24 figures, 5 tables.