The Computable Differential Equation Lecture ... - Bruce E. Shapiro
The Computable Differential Equation Lecture ... - Bruce E. Shapiro
The Computable Differential Equation Lecture ... - Bruce E. Shapiro
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
56 CHAPTER 3. APPROXIMATE SOLUTIONS<br />
Figure 3.3: Geometry for <strong>The</strong>orem 3.8<br />
3.5 Euler’s Method for Systems<br />
<strong>The</strong> numerical methods we will discuss in this class can all easily be extended to<br />
systems. For a system, we have<br />
y ′ = f(t, y) (3.115)<br />
y(t 0 ) = y 0 (3.116)<br />
To emphasize that y and y 0 are vectors and that f is a vector function we have<br />
written them all in bold-face. Euler’s method then becomes<br />
Example 3.2. Solve the initial value problem<br />
on the interval [0, π] using h = π/4.<br />
y n+1 = y n + h n f(t n , y n ) (3.117)<br />
y ′ 1(t) = y 2 (t) (3.118)<br />
y ′ 2(t) = −2y 1 (t) (3.119)<br />
y 1 (0) = 1 (3.120)<br />
y 2 (0) = 0 (3.121)<br />
Solution. Let y = (y 1 , y 2 ) T . <strong>The</strong>n y(0) = y 0 = (1, 0) T , and we write<br />
f(t, y) = (y 2 , −2y 1 ) T (3.122)<br />
Math 582B, Spring 2007<br />
California State University Northridge<br />
c○2007, B.E.<strong>Shapiro</strong><br />
Last revised: May 23, 2007