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.

CHAPTER 6. LINEAR MULTISTEP METHODS 133<br />

Table 6.7: Enright Second Derivative Multistep Methods. <strong>The</strong> methods have order<br />

ν + 2.<br />

Method (ν) Iteration Formula<br />

1 y n = y n−1 + h ( 2<br />

3 f n + 1 3 f )<br />

n−1 −<br />

1<br />

6 h2 g n<br />

2 y n = y n−1 + h ( 29<br />

48 f n + 5<br />

12 f n−1 − 1<br />

48 f n−2<br />

)<br />

−<br />

1<br />

8 h2 g n<br />

3 y n = y n−1 + h ( 307<br />

540 f n + 19<br />

40 f n−1 − 1<br />

20 f n−2 + 7<br />

1080 f n−3<br />

)<br />

−<br />

19<br />

480 h2 g n<br />

4 y n = y n−1 + h ( 3133<br />

4760 f n + 47<br />

90 f n−1 − 41<br />

480 f n−2 + 1<br />

45 f n−3 − 17<br />

5760 f n−4<br />

)<br />

−<br />

3<br />

32 h2 g n<br />

6.8 Prediction-Correction (P(EC) n E) Techniques<br />

At each iteration step in an implicit linear multistep method such as<br />

a 0 y n + a 1 y n−1 + · · · + a k y n−k = h(b 0 f n + b 1 f n−1 + · · · + b k f n−k ) (6.130)<br />

where y and f are m-vectors (for systems, or scalars for a scalar equation), and<br />

f p = f(t p , y p ), we are faced with the problem of knowing what value of y n to use in<br />

the term in f n in the right hand side of the equation. More specifically, we have<br />

a 0 y n = hb 0 f(t n , y n ) − a 1 y n−1 − · · · − a k y n−k + h(+b 1 f n−1 + · · · + b k f n−k ) (6.131)<br />

where y n appears on both sides of the equation.<br />

When the system is not stiff, it is generally possible to find a step size h such<br />

that<br />

∥ ∥∥∥ ∂f<br />

hb 0 ∂y ∥ ≤ r < 1 (6.132)<br />

for some number r, in which case the method is a contraction (for scalar equations,<br />

|hb 0 f y | ≤ r ), the fixed-point theorem applies, and one can use fixed point iteration<br />

to find y n given a reasonably good starting guess. <strong>The</strong> general heuristic is<br />

to use an explicit method of the same order for the first guess. This is called the<br />

prediction (P) step. This first guess for y n is used to estimate (E-step) the value of<br />

f(t, y n ); then the implicit method is used to calculate a corrected (C-step) estimate<br />

of y n . This corrected estimate is substituted back into the method for one final<br />

calculation (E-step). This type of method is often called a PEC, PECE, P(EC) n , or<br />

P(EC) n E method, depending on the number of estimation - correction iterations.<br />

<strong>The</strong>se prediction-correction are essentially explicit methods even though they<br />

use an implicit formula, because the method is based on an explicit evaluation of<br />

the function at the previous step, rather than using a solver to determine the volume.<br />

If the equation is stiff, then a PECE method is not sufficient, because it is extremely<br />

expensive to find a value of h such that |hbf y | ≤ r < 1. Instead, the value<br />

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

Last revised: May 23, 2007<br />

Math 582B, Spring 2007<br />

California State University Northridge

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

Saved successfully!

Ooh no, something went wrong!