21.04.2015 Views

The Computable Differential Equation Lecture ... - Bruce E. Shapiro

The Computable Differential Equation Lecture ... - Bruce E. Shapiro

The Computable Differential Equation Lecture ... - Bruce E. Shapiro

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

150 CHAPTER 7. DELAY DIFFERENTIAL EQUATIONS<br />

y, y ′ , y ′′ , . . . , y (p+1) ; however, we may not even know where all the discontinuities<br />

are. For a system with time-dependent delay,<br />

Discontinuities can arise because<br />

y ′ = f(t, y(t), y(t − τ(t, y))) (7.87)<br />

y(t) = g(t), t ≤ t 0 (7.88)<br />

• <strong>The</strong> initial function g(t) may have discontinuities.<br />

• <strong>The</strong> initial function g(t) may not link smoothly to the solution at t = t 0 . This<br />

will lead to a discontinuity in y ′′ at the next step, y ′′′ at the following step,<br />

and so on.<br />

• Discontinuities in the derivatives of f, τ, and g.<br />

In particular, one can construct pathological examples where the distance between<br />

discontinuities gets smaller and smaller, approaching zero as t → ξ for some number<br />

ξ. This vanishing delay can lead one to require infinitely small grid spacing, which<br />

is not possible. <strong>The</strong> subject of discontinuity is subtle and non-trivial. We will not<br />

consider the details here (see [3] for details) except to point out that when the delay<br />

is not constant they can arise in unexpected places. When the delay is constant,<br />

the functions f and g are smooth and the solution matches g at t = 0 then the only<br />

discontinuities correspond to multiples of the delay.<br />

Definition 7.3. Let<br />

y n+1 =<br />

k∑<br />

α n,i y n+1−i + h n+1 φ(y n , . . . , y n−k+1 ) (7.89)<br />

i=1<br />

be a general multistep method for the initial value problem y ′ = f(t, y), y(t 0 ) =<br />

y 0 . <strong>The</strong>n a continuous extension of the method is a piecewise polynomial<br />

interpolant η(t)<br />

η(t n + θh n+1 ) =<br />

j n+i<br />

∑ n+1<br />

i=1<br />

β n,i (θ)y n+jn−i+1 + h n+1 φ(y n+jn , . . . , y n−in ) (7.90)<br />

η(t n ) = y n (7.91)<br />

η(t n+1 ) = y n+1 (7.92)<br />

that is computed on an interval I = [t n−in , t n+jn+1], where [t n , t n+1 ] ⊂ I.<br />

A continuous Runge-Kutta method, for example, is<br />

y(t n + θh) = y n + h<br />

Y ni = y n + h<br />

2∑<br />

b i (θ)f(t n , Y ni (7.93)<br />

i=1<br />

2∑<br />

a ij Y nj (7.94)<br />

j=1<br />

Math 582B, Spring 2007<br />

California State University Northridge<br />

c○2007, B.E.<strong>Shapiro</strong><br />

Last revised: May 23, 2007

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!