The Computable Differential Equation Lecture ... - Bruce E. Shapiro
The Computable Differential Equation Lecture ... - Bruce E. Shapiro The Computable Differential Equation Lecture ... - Bruce E. Shapiro
68 CHAPTER 3. APPROXIMATE SOLUTIONS By the ODE (y ′ = f(t, y)) and the mean value theorem (in the second argument) d [y(t) − ỹ(t)] = f(t, y(t)) − f(t, ỹ(t)) (3.217) dt for some η(t) between y(t) and ỹ(t). Hence = [y(t) − ỹ(t)] ∂ f(t, η(t)) (3.218) ∂y ∂p(t, y 0 ) ∂t = y(t) − ỹ(t) y 0 − ỹ 0 ∂ f(t, η(t)) (3.219) ∂y = p(t, y 0 ) ∂ f(t, η(t)) (3.220) ∂y where η(t) → y(t) as ỹ(t) → y(t). Since p ≠ 0 so long as y 0 ≠ ỹ 0 , we may divide by p: 1 ∂p(t, y 0 ) = ∂ f(t, η(t)) (3.221) p(t , y 0 ) ∂t ∂y ln p(t , y 0 ) = ∫ t t 0 ∂ f(s, η(s))ds (3.222) ∂y The constant of integration is determined from p(t 0 , y 0 ) = 1, and {∫ t } ∂ p(t , y 0 ) = exp t 0 ∂y f(s, η(s))ds (3.223) By the definition of p, ∂y(t, ỹ 0 ) ∂y 0 = lim p(t, y 0 ) (3.224) y 0 →ỹ 0 {∫ t } ∂ = exp ∂y f(s, ỹ(s))ds (3.225) t 0 which is continuous in both arguments. Math 582B, Spring 2007 California State University Northridge c○2007, B.E.Shapiro Last revised: May 23, 2007
Chapter 4 Improving on Euler’s Method 4.1 The Test Equation and Problem Stability Consider the initial value problem y ′ = f(t, y), y(0) = y 0 (4.1) What happens if we perturb the initial condition a small amount, ŷ ′ = f(t, ŷ), ŷ(0) = ŷ 0 (4.2) where ŷ 0 = y 0 + δ for some small number δ? How will the two solutions behave with respect to one another? Consider, for example, the following initial value problem, which we shall refer to as the scalar test equation. y ′ = λy, y(0) = y 0 (4.3) We will find it instructive to test many of our methods with the scalar test problem and will formulate much of our theory around this problem, mainly because it is easy to solve and we can describe its behavior very easily.The solution of the scalar problem is y(t) = y 0 e λt (4.4) The perturbed equation has solution and so if λ ∈ R the two solutions will differ by y(t) = ŷ 0 e λt (4.5) ɛ(t) = |y(t) − ŷ(t)| = |y 0 − ŷ 0 |e λt (4.6) Therefore ⎧ ⎪⎨ 0, λ < 0 lim ɛ(t) = |y t→∞ ⎪ 0 − ŷ 0 |, λ = 0 ⎩ ∞, λ > 0 69 (4.7)
- Page 23 and 24: CHAPTER 1. CLASSIFYING THE PROBLEM
- Page 25 and 26: CHAPTER 1. CLASSIFYING THE PROBLEM
- Page 27 and 28: CHAPTER 1. CLASSIFYING THE PROBLEM
- Page 29 and 30: CHAPTER 1. CLASSIFYING THE PROBLEM
- Page 31 and 32: Chapter 2 Successive Approximations
- Page 33 and 34: CHAPTER 2. SUCCESSIVE APPROXIMATION
- Page 35 and 36: CHAPTER 2. SUCCESSIVE APPROXIMATION
- Page 37 and 38: CHAPTER 2. SUCCESSIVE APPROXIMATION
- Page 39 and 40: CHAPTER 2. SUCCESSIVE APPROXIMATION
- Page 41 and 42: CHAPTER 2. SUCCESSIVE APPROXIMATION
- Page 43 and 44: CHAPTER 2. SUCCESSIVE APPROXIMATION
- Page 45 and 46: CHAPTER 2. SUCCESSIVE APPROXIMATION
- Page 47 and 48: CHAPTER 2. SUCCESSIVE APPROXIMATION
- Page 49 and 50: Chapter 3 Approximate Solutions 3.1
- Page 51 and 52: CHAPTER 3. APPROXIMATE SOLUTIONS 45
- Page 53 and 54: CHAPTER 3. APPROXIMATE SOLUTIONS 47
- Page 55 and 56: CHAPTER 3. APPROXIMATE SOLUTIONS 49
- Page 57 and 58: CHAPTER 3. APPROXIMATE SOLUTIONS 51
- Page 59 and 60: CHAPTER 3. APPROXIMATE SOLUTIONS 53
- Page 61 and 62: CHAPTER 3. APPROXIMATE SOLUTIONS 55
- Page 63 and 64: CHAPTER 3. APPROXIMATE SOLUTIONS 57
- Page 65 and 66: CHAPTER 3. APPROXIMATE SOLUTIONS 59
- Page 67 and 68: CHAPTER 3. APPROXIMATE SOLUTIONS 61
- Page 69 and 70: CHAPTER 3. APPROXIMATE SOLUTIONS 63
- Page 71 and 72: CHAPTER 3. APPROXIMATE SOLUTIONS 65
- Page 73: CHAPTER 3. APPROXIMATE SOLUTIONS 67
- Page 77 and 78: CHAPTER 4. IMPROVING ON EULER’S M
- Page 79 and 80: CHAPTER 4. IMPROVING ON EULER’S M
- Page 81 and 82: CHAPTER 4. IMPROVING ON EULER’S M
- Page 83 and 84: CHAPTER 4. IMPROVING ON EULER’S M
- Page 85 and 86: CHAPTER 4. IMPROVING ON EULER’S M
- Page 87 and 88: CHAPTER 4. IMPROVING ON EULER’S M
- Page 89 and 90: CHAPTER 4. IMPROVING ON EULER’S M
- Page 91 and 92: CHAPTER 4. IMPROVING ON EULER’S M
- Page 93 and 94: CHAPTER 4. IMPROVING ON EULER’S M
- Page 95 and 96: Chapter 5 Runge-Kutta Methods 5.1 T
- Page 97 and 98: CHAPTER 5. RUNGE-KUTTA METHODS 91 w
- Page 99 and 100: CHAPTER 5. RUNGE-KUTTA METHODS 93 w
- Page 101 and 102: CHAPTER 5. RUNGE-KUTTA METHODS 95 5
- Page 103 and 104: CHAPTER 5. RUNGE-KUTTA METHODS 97 F
- Page 105 and 106: CHAPTER 5. RUNGE-KUTTA METHODS 99 T
- Page 107 and 108: CHAPTER 5. RUNGE-KUTTA METHODS 101
- Page 109 and 110: CHAPTER 5. RUNGE-KUTTA METHODS 103
- Page 111 and 112: CHAPTER 5. RUNGE-KUTTA METHODS 105
- Page 113 and 114: CHAPTER 5. RUNGE-KUTTA METHODS 107
- Page 115 and 116: CHAPTER 5. RUNGE-KUTTA METHODS 109
- Page 117 and 118: CHAPTER 5. RUNGE-KUTTA METHODS 111
- Page 119 and 120: CHAPTER 5. RUNGE-KUTTA METHODS 113
- Page 121 and 122: CHAPTER 5. RUNGE-KUTTA METHODS 115
- Page 123 and 124: Chapter 6 Linear Multistep Methods
Chapter 4<br />
Improving on Euler’s Method<br />
4.1 <strong>The</strong> Test <strong>Equation</strong> and Problem Stability<br />
Consider the initial value problem<br />
y ′ = f(t, y), y(0) = y 0 (4.1)<br />
What happens if we perturb the initial condition a small amount,<br />
ŷ ′ = f(t, ŷ), ŷ(0) = ŷ 0 (4.2)<br />
where ŷ 0 = y 0 + δ for some small number δ? How will the two solutions behave with<br />
respect to one another?<br />
Consider, for example, the following initial value problem, which we shall refer<br />
to as the scalar test equation.<br />
y ′ = λy, y(0) = y 0 (4.3)<br />
We will find it instructive to test many of our methods with the scalar test problem<br />
and will formulate much of our theory around this problem, mainly because it is<br />
easy to solve and we can describe its behavior very easily.<strong>The</strong> solution of the scalar<br />
problem is<br />
y(t) = y 0 e λt (4.4)<br />
<strong>The</strong> perturbed equation has solution<br />
and so if λ ∈ R the two solutions will differ by<br />
y(t) = ŷ 0 e λt (4.5)<br />
ɛ(t) = |y(t) − ŷ(t)| = |y 0 − ŷ 0 |e λt (4.6)<br />
<strong>The</strong>refore<br />
⎧<br />
⎪⎨ 0, λ < 0<br />
lim ɛ(t) = |y<br />
t→∞ ⎪ 0 − ŷ 0 |, λ = 0<br />
⎩<br />
∞, λ > 0<br />
69<br />
(4.7)