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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

118 CHAPTER 6. LINEAR MULTISTEP METHODS<br />

corresponding to a method with coefficients {a 0 , a 1 , . . . , b 0 , . . . } as<br />

Lu(t) =<br />

k∑<br />

[a j u n−j − hb j u ′ n−j] (6.4)<br />

j=0<br />

for any arbitrary continuously differentiable function u with discretiztion u n . If y(t)<br />

is the exact solution of the differential equation y ′ = f then<br />

k∑<br />

Ly(t) = [a j y n−j − hb j f n−j ] (6.5)<br />

j=0<br />

Expanding the terms y n−j and f n−j right hand side in a Taylor series,<br />

y n−j = y n − jhy ′ n + (jh)2<br />

2 y′′<br />

n + · · · + (−jh)k<br />

k!<br />

f n−j = y n ′ − jhy n ′′ + (jh)2<br />

2 y′′′ n + · · · + (−jh)k<br />

(<br />

k!<br />

a j y n−j − hb j f n−j = a 0 y n + (ja 1 − b 0 )hy n ′ a2<br />

)<br />

+<br />

2 j2 − jb 1<br />

Hence we have<br />

where<br />

Ly(t) =<br />

C 0 =<br />

+ (−1) k (<br />

aj j k<br />

k∑<br />

j=0 i=0<br />

k!<br />

− b jj k−1<br />

(k − 1)!<br />

∞∑<br />

(<br />

(−1) i aj j i<br />

i!<br />

y (k)<br />

n + · · · (6.6)<br />

y (k+1)<br />

n + · · · (6.7)<br />

h 2 y ′′<br />

n + · · · (6.8)<br />

)<br />

h k y (k)<br />

n + · · · (6.9)<br />

(6.10)<br />

− b jj i−1 )<br />

h i y n (i)<br />

(6.11)<br />

(i − 1)!<br />

= C 0 y n + C 1 hy ′ n + C 2 h 2 y ′′<br />

n + · · · (6.12)<br />

k∑<br />

a j (6.13)<br />

j=0<br />

C i = (−1) i ⎡<br />

⎣ 1 i!<br />

k∑<br />

j i 1<br />

a j +<br />

(i − 1)!<br />

j=1<br />

Hence the order of the method is p if<br />

k∑<br />

j=0<br />

j (i−1) b j<br />

⎤<br />

⎦ (6.14)<br />

C 0 = C 1 = · · · = c p = 0, c p+1 ≠ 0 (6.15)<br />

and therefore to obtain a method of order p, we need to set successive values of C<br />

to zero:<br />

0 = a 0 + a 1 + · · · + a k (6.16)<br />

0 = (a 1 + 2a 2 + · · · + ka k ) + (b 0 + b 1 + · · · + b k ) (6.17)<br />

0 = 1 2 (a 1 + 4a 2 + · · · + k 2 a k ) + (b 1 + 2b 2 + · · · + kb k ) (6.18)<br />

. (6.19)<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!