+ h4. + h5. 6! f (5) i. (C.3) Since., it yields

Size: px
Start display at page:

Download "+ h4. + h5. 6! f (5) i. (C.3) Since., it yields"

Transcription

1 Appendix C. Derivation of the Numerical Integration Formulae C.1. Derivation of the Numerical Integration of dy(x) / dx = f (x) For a given analytical or taulated function f (x), the left column in Tale 3.1 shows how to determine y(x) numerically, where dy(x) / dx = f (x). In this section, we will show how to otain the integration rules listed in the left column of Tale 3.1 for the given accuracy. Based on Taylor s series expansion, we have + hf i + h2 2! C.1.1. The first-order numerical integration f i + h3 3! f (2) i + h4 4! f (3) i + h5 5! f (4) i + h6 6! f (5) i +... (C.1) Oviously, the first-order numerical integration should e + hf i + O(h 2 ) (C.2) C.1.2. The second-order numerical integration (Trapezoidal rule) Let the second-order numerical integration e + h(af i + f i+1 ) + O(h 3 ) (C.3) Since f i+1 + h f i + O(h 2 ) (C.4) Sustituting Eq. (C.4) into Eq. (C.3) to eliminate f i+1, it yields or + h{af i + [ f i + h f i + O(h 2 )]} + O(h 3 ) + h(a + ) f i + h 2 f i + O(h 3 ) (C.5) Comparing the coefficients in Eqs. (C.1) and (C.5), it yields a + = 1 and = 1/ 2. Hence, a = 1/ 2. As a result, we otain the well-known Trapezoidal rule, + h( f i + f i+1 ) + O(h 3 ) (C.6) 2 C-1

2 C.1.3. The fourth-order numerical integration (Simpson s rule) Let a fourth-order numerical integration e + h(a f i + f i+(1/2) + c f i+1 ) + O(h 5 ) (C.7) Since f i+(1/2) + h 2 f (h / 2)2 i + 2! f i (2) + (h / 2)3 3! f i (3) + O(h 4 ) (C.8) f i+1 + h f i + h2 2! f (2) i + h3 3! f (3) i + O(h 4 ) (C.9) Sustituting Eqs. (C.8) and (C.9) into Eq. (C.7) to eliminate f i+(1/2) and f i+1, respectively, it yields or + h{af i + [ f i + h 2 f (h / 2)2 i + 2! f i (2) + (h / 2)3 3! f i (3) + O(h 4 )] + c[ f i + h f i + h2 2! f (2) i + h3 3! f (3) i + O(h 4 )]} + O(h 5 ) + h(a + + c) f i + h 2 ( c) f + h3 ( ! + 1 2! c) f (2) i + h 4 ( ! + 1 3! c) f (3) i + O(h 5 ) (C.10) Comparing the coefficients in Eqs. (C.1) and (C.10), it yields a + + c = c = 1 2! ! + 1 2! c = 1 3! (C.11) (C.12) (C.13) where Eqs. (C.12) and (C.13) can e rewritten as c = 1!2 1 / 2! 2!2 2 / 3! (C.14) Solving Eq. (C.14), it yields = 4 / 6, c = 1/ 6. Sustituting these results into Eq. (C.11), it yields a = 1/ 6. It is interesting to note that the following equation is satisfied C-2

3 ! + 1 3! c = 1 4! Thus, the following Simpson rule is indeed a fourth-order-accuracy integration form + h( 1 6 f i f i+(1/2) f i+1 ) + O(h5 ) (C.15) C.1.4. The Simpson s 3/8 rule (a fourth-order numerical integration) Let a fourth-order numerical integration e + h(a f i + f i+(1/3) + c f i+(2/3) + d f i+1 ) + O(h 5 ) (C.16) Since f i+(1/3) + h 3 f (h / 3)2 i + 2! f i (2) + (h / 3)3 3! f i (3) + O(h 4 ) (C.17) f i+(2/3) + 2h 3 (2h / 3)2 f i + 2! f i (2) + (2h / 3)3 3! f i (3) + O(h 4 ) (C.18) f i+1 + h f i + h2 2! f (2) i + h3 3! f (3) i + O(h 4 ) (C.19) Sustituting Eqs. (C.17), (C.18), and (C.19) into Eq. (C.16), then comparing the coefficients in the resulting equation with the coefficients in equation (C.1), it yields a + + c + d = 1 (C.20) c d = 1!3 1 / 2! 2!3 2 / 3! 3!3 3 / 4! (C.21) Solving Eq. (C.21), it yields = 3 / 8, c = 3 / 8, d = 1/ 8. Sustituting these results into Eq. (C.20), it yields a = 1/ 8. We have otained the Simpson s 3/8 law + h( 1 8 f i f i+(1/3) f i+(2/3) f i+1) + O(h 5 ) (C.22) C-3

4 C.1.5. The sixth-order numerical integration Let a sixth-order numerical integration e + h(a f i + f i+(1/4) + c f i+(1/2) + d f i+(3/4) + e f i+1 ) + O(h 7 ) (C.23) Since f i+(1/4) + h 2 f (h / 4)2 i + 2! f i (2) + (h / 4)3 3! f i (3) + (h / 4)4 4! f i (4) + (h / 4)5 5! f i (5) + O(h 6 ) (C.24) f i+(1/2) + h 2 f (h / 2)2 i + 2! f i (2) + (h / 2)3 3! f i (3) + (h / 2)4 4! f i (4) + (h / 2)5 5! f i (5) + O(h 6 ) (C.25) f i+(1/2) + 3h 4 (3h / 4)2 f i + 2! f i (2) + (3h / 4)3 3! f i (3) + (3h / 4)4 4! f i (4) + (3h / 4)5 5! f i (5) + O(h 6 ) (C.26) f i+1 + h f i + h2 2! f (2) i + h3 3! f (3) i + h4 4! f (4) i + h5 5! f (5) i + O(h 6 ) (C.27) Sustituting Eqs. (C.24), (C.25), and (C.26) into Eq. (C.23), then comparing the coefficients in the resulting equation with the coefficients in equation (C.1), it yields a + + c + d + e = 1 (C.28) c d e = 1!4 1 / 2! 2!4 2 / 3! 3!4 3 / 4! 4!4 4 / 5! (C.29) Solving Eq. (C.29), it yields = 32 / 90, c = 12 / 90, d = 32 / 90, e = 7 / 90. Sustituting these results into Eq. (C.28), it yields a = 7 / 90. Note that the following equation is also satisfied c d e = 5!4 5 / 6! Thus, we have otained the sixth-order integration formula C-4

5 + h( 7 90 f i f i+(1/4) f i+(1/2) f i+(3/4) f i+1 ) + O(h7 ) (C.30) C.1.6. Summary of the higher-order numerical integration In summary, we can otain the higher-order numerical integration of dy(x) / dx = f (x) ased on the procedures discussed in this Section C.1. C.2. Derivation of the Runge-Kutta Method (This section has een revised on ) For dy(t) / dt = f [t, y(t)], the right column in Tale 3.1 shows numerical method to otain y(t), for a given initial value of y 0 = y(t = 0). Based on the Taylor s series expansion, we have y n+1 = y n + Δt 1! ( f ) + (Δt)2 ( df t=t n 2! dt ) + (Δt)3 ( d 2 f t=t n 3! dt ) + (Δt)4 ( d 3 f 2 t=t n 4! dt ) + O((Δt) 5 f (4) ) 3 t=t n (C.31) Since d dt f = ( t + f y ) f Eq. (C.31) can e rewritten as y n+1 = y n + Δt( f ) t=t n + (Δt)2 2 ( f y ) t=t n + (Δt)3 6 [ t ( f y ) + f y ( f y )] t=t n + (Δt)4 24 { t [ t ( f y ) + f y ( f y )] + f y [ t ( f y ) + f y ( f y )]} + O((Δt) 5 f (4) ) t=t n (C.32) C.2.1. The Second-Order Runge-Kutta Method Let us assume a second-order expression of y n+1 y n+1 = y n + Δt[a f 1 + ]+O((Δt) 3 f (2) ) (C.33) where f 1 = f (t n, y n ), y n + Δt f 1 ) (C.34) (C.35) C-5

6 Since the 2-dimensional Taylor s series expansion of f (t + Δt, y + Δy) can e written as f (t + Δt, y + Δy) = f (t, y) + (Δt t + Δy y ) f (t, y)+ 1 2! (Δt t + Δy y )2 f (t, y) k! (Δt t + Δy y )k f (t, y)+... (C.36) Let ( f ) t=t n = f (t n, y n ). Sustituting the 2-dimensional Taylor s series expansion of the function f (t n + Δt, y n + Δt( f ) t=t n ) into Eq. (C.35), it yields = ( f ) t=t n + Δt( f y ) t=t n +O[(Δt) 2 f (2) ] (C.37) Sustituting Eqs. (C.34) and (C.37) into Eq. (C.33), it yields y n+1 = y n + Δt{a( f ) t=t n + [( f ) t=t n + Δt( f y ) t=t n ]} + O[(Δt) 3 f (2) ] (C.38) Comparing the coefficients in Eqs. (C.32) and (C.38), it yields a = = 1/ 2. Thus, we have otained the expression of the second-order Runge-Kutta method y n+1 = y n + Δt[ 1 2 ( f ) t=t n f (t n + Δt, y n + Δt( f ) t=t n )]+ O((Δt) 3 f (2) ) (C.39) The second-order Runge-Kutta method shown in Eq. (C.39) is similar to the Trapezoidal rule of the second-order integration shown in the first column of Tale 3.1, ut is different from the second-order Runge-Kutta method shown in the second column of Tale 3.1. Apparently, the expression of the second-order Runge-Kutta method is not unique. Let us assume another second-order expression of y n+1 y n+1 = y n + Δt[a f 1 + ]+O((Δt) 3 f (2) ) (C.40) where f 1 = f (t n, y n ) (C.41) 2, yn + Δt 2 f 1) (C.42) Sustituting the 2-dimensional Taylor s series expansion of the function f (t n + (Δt / 2), y n + (Δt / 2)( f ) t=t n ) into Eq. (C.42), it yields = ( f ) t=t n + Δt 2 ( f y ) t=t n +O[(Δt) 2 f (2) ] (C.43) Sustituting Eqs. (C.41) and (C.43) into Eq. (C.40), it yields C-6

7 y n+1 = y n + Δt{a( f ) t=t n + [( f ) t=t n + Δt 2 ( f y ) t=t n ]}+O[(Δt) 3 f (2) ] (C.44) Comparing the coefficients in Eqs. (C.32) and (C.44), it yields a = 0 and =1. Thus, we have otained another expression of the second-order Runge-Kutta method y n+1 = y n + Δt f (t n + Δt 2, yn + Δt 2 ( f ) t=t n )+O((Δt) 3 f (2) ) (C.45) The second-order Runge-Kutta method shown in Eq. (C.45) is the same as the one shown in the second column of Tale 3.1. The expression given in Eq. (C.45) is also similar to the second-order Lax-Wendroff scheme discussed in Section 3.1. C.2.2. The Fourth-Order Runge-Kutta Method Let us assume a fourth-order expression of y n+1 y n+1 = y n + Δt[a f c + d f 4 ]+ O((Δt) 5 f (4) ) (C.46) where f 1 = f (t n, y n ) (C.47) 2, yn + Δt 2 f 1) (C.48) 2, yn + Δt 2 ) (C.49) f 4, y n + Δt ) (C.50) Let ( f ) t=t n = f (t n, y n ). Sustituting the 2-dimensional Taylor s series expansion of the function f (t n + (Δt / 2), y n + (Δt / 2)( f ) t=t n ) into Eq. (C.48), it yields = ( f ) t=t n + Δt 2 ( f y ) + 1 t=t n 2 (Δt 2 )2 ( 2 f t + 2 f 2 f 2 t y + f 2 y ) 2 t=t n (Δt 2 )3 ( 3 f t + 3 f 3 f 3 t 2 y + 3 f 3 t y + f 3 2 y ) 3 t=t n (Δt 2 )4 ( 4 f t + 4 f 4 f 4 t 3 y f t 2 y + 4 f 4 2 t y + f 4 f 4 3 y ) +O[(Δt) 5 f (5) ] 4 t=t n (C.51) Sustituting the 2-dimensional Taylor s series expansion of the function f (t n + (Δt / 2), y n + (Δt / 2) ) into Eq. (C.49), it yields C-7

8 = ( f ) t=t n + Δt 2 ( f 2 y ) + 1 t=t n 2 (Δt 2 )2 ( 2 f t + 2 f 2 f 2 2 t y + ( f 2 f 2 )2 y ) 2 t=t n (Δt 2 )3 ( 3 f t f t 2 y + 3( ) 2 3 f t y + ( f 3 f 2) 3 2 y ) 3 t=t n (Δt 2 )4 ( 4 f t + 4 f 4 f 4 2 t 3 y + 6( f 4 f 2) 2 t 2 y + 4( f 4 f 2) 3 2 t y + ( f 4 f 2) 4 3 y ) +O[(Δt) 5 f (5) ] 4 t=t n (C.52) Sustituting the 2-dimensional Taylor s series expansion of the function f (t n + Δt, y n + Δt ) into Eq. (C.50), it yields f 4 = ( f ) t=t n + Δt( f 3 y ) + 1 t=t n 2 (Δt)2 ( 2 f t (Δt)3 ( 3 f t + 3 f 3 f 3 3 t 2 y + 3( f 3 f 3) 2 t y + ( f 3 f 3) 3 2 y ) 3 t=t n (Δt)4 ( 4 f t + 4 f f t y + ( f 2 f 3 )2 y ) 2 t=t n 4 f t 3 y + 6( f 4 f 3) 2 t 2 y + 4( f 4 f 3) 3 2 t y + ( f 4 f 3) 4 3 y ) +O[(Δt) 5 f (5) ] 4 t=t n (C.53) Sustituting Eqs. (C.47), (C.51)-(C.53) into Eq. (C.46), it yields y n+1 = y n + Δt[(a + + c + d)( f ) t=t n ] +(Δt) 2 [( 2 + c 2 + d)( f y ) t=t n ] + (Δt)3 2 [( 4 + c 4 + f d)( 2 t + 2 f 2 f 2 t y + f 2 y ) + ( c 2 t=t n 2 + d)( f y ) ( f t=t n y ) ] t=t n + (Δt)4 6 [( 8 + c 8 + f d)( 3 t + 3 f 3 f 3 t 2 y + 3 f 3 t y + f 3 2 y ) 3 t=t n + ( 3c 8 + 3d f 4 )( 2 t + 2 f 2 f 2 t y + f 2 y ) ( f 2 t=t n y ) t=t n + ( 3d 2 )( f y ) ( f t=t n y ) 2 t=t n + ( 3c 4 + 3d)( f ) t=t n ( f y ) t=t n ( 2 f y 2 ) t=t n + ( 3c 4 + 3d)( f y ) t=t n ( 2 f t y ) t=t n ] + (Δt)5 24 [( 16 + c 16 + f d)( 4 t + 4 f 4 f 4 t 3 y + 6 +O((Δt) 6 f (5) ) 4 f t 2 y + 4 f 4 2 t y + f 4 f 4 3 y ) +...] 4 t=t n (C.54) C-8

9 For easy comparison, we rewrite Eq. (C.32) into the following form y n+1 = y n + Δt( f ) t=t n + (Δt)2 2 ( f y ) t=t n + (Δt)3 f 6 [( 2 t + 2 f 2 f 2 t y + f 2 f f 2 )+ ( 2 y y )( f y )] t=t n + (Δt)4 f 24 [( 3 t + 3 f 3 f 3 t 2 y + 3 f 3 t y + f 3 2 y ) 3 + ( 2 f t f 2 f t y + 2 f y 2 )( f y ) + ( f y )( f y )2 + 3( f )( f y )( 2 f y 2 ) + 3( f y )( 2 f t y )] t=t n + (Δt)5 f 120 [( 4 t + 4 f 4 f 4 t 3 y + 6 +O((Δt) 6 f (5) ) 4 f t 2 y + 4 f 4 2 t y + f 4 f 4 3 y ) +...] 4 t=t n (C.55) If Eq. (C.54) is equal to Eq. (C.55), the coefficients in Eqs. (C.54) and (C.55) should e identical to each other. Namely, a + + c + d = c 2 + d = c 4 + d = 1 3 c 2 + d = c 8 + d = 1 4 3c 8 + 3d 4 = 1 4 C-9 3d 2 = 1 4 3c 4 + 3d = c 16 + d = 1 5 (C.56) (C.57) (C.58) (C.59) (C.60) (C.61) (C.62) (C.63) (C.64)

10 Solving Eqs. (C.56)-(C.59), we can find a set of solutions a = d = 1/ 6 and = c = 1/ 3. These solutions also satisfy Eqs. (C.60)-(C.63), ut do not satisfy Eq. (C.64). Thus, we have otained the expression of the fourth-order Runge-Kutta method y n+1 = y n + Δt[ 1 6 f f 4 ]+O((Δt)5 f (4) ) (C.65) where f 1 = f (t n, y n ) 2, yn + Δt 2 f 1 ) 2, yn + Δt 2 ) f 4, y n + Δt ) C.2.3. Looking for the Third-Order and Higher-Order Expressions of y n+1 Let us assume a third-order expression of y n+1 y n+1 = y n + Δt[a f c ]+O((Δt) 4 f (3) ) (C.66) where f 1 = f (t n, y n ) k, yn + Δt k f 1) l, yn + Δt ) l (C.67) (C.68) (C.69) Let ( f ) t=t n = f (t n, y n ). Sustituting the 2-dimensional Taylor s series expansion of the function f (t n + (Δt / k), y n + (Δt/ k)( f ) t=t n ) into Eq. (C.68), it yields = ( f ) t=t n + Δt k ( f y ) + 1 t=t n 2 (Δt k )2 ( 2 f t + 2 f 2 f 2 t y + f 2 y ) +O[(Δt) 3 f (3) ] 2 t=t n (C.70) Sustituting the 2-dimensional Taylor s series expansion of the function f (t n + (Δt / l), y n + (Δt / l) ) into Eq. (C.69) yields = ( f ) t=t n + Δt l ( f 2 y ) + 1 t=t n 2 (Δt l )2 ( 2 f t + 2 f 2 f 2 2 t y + ( f 2 f 2) 2 y ) +O[(Δt) 3 f (3) ] 2 t=t n Sustituting Eqs. (C.67), (C.70) and (C.71) into Eq. (C.66), it yields C-10 (C.71)

11 y n+1 = y n + Δt[(a + + c)( f ) t=t n ] +(Δt) 2 [( k + c l )( f y ) t=t n ] + (Δt)3 2 [( k + c f 2 l 2 )( 2 t + 2 f 2 f 2 t y + f 2 y ) ] 2 t=t n +(Δt) 3 [ c kl ( f y ) t=t n ( f y ) t=t n ]+O((Δt) 4 f (3) ) (C.72) For easy comparison, we cast Eq. (C.32) into the following form y n+1 = y n + Δt( f ) t=t n + (Δt)2 2 ( f y ) t=t n + (Δt)3 f 6 [( 2 t + 2 f 2 f 2 t y + f 2 f f 2 )+ ( 2 y y )( f y )] +O((Δt) 4 f (3) ) t=t n (C.73) If Eq. (C.72) is equal to Eq. (C.73), the coefficients in Eqs. (C.72) and (C.73) should e identical to each other. Namely, a + + c = 1 k + c l = 1 2 k + c 2 l = c kl = 1 6 (C.74) (C.75) (C.76) (C.77) Solving Eqs. (C.56)-(C.59), we can find a set of solutions a =1/ 4, = 0, c = 3 / 4, k = 3, and l = 3 / 2. Thus, we have otained an expression of the third-order Runge-Kutta method y n+1 = y n + Δt[ 1 4 f ]+O((Δt) 4 f (3) ) (C.78) where f 1 = f (t n, y n ) 3, yn + Δt 3 f 1) = f (t n Δt, yn Δt ) C-11

12 Exercise C.1 Find a general expression of the second-order expression of y n+1 Let us assume a second-order expression of y n+1 y n+1 = y n + Δt[a f 1 + ]+ O((Δt) 3 f (2) ) (C.79) where f 1 = f (t n, y n ) k, yn + Δt k f 1 ) Please find possile solutions of a,, and k. (C.80) (C.81) Answer: Sustituting Eqs. (C.80) and (C.70) into Eq. (C.79), it yields Possile solutions include: a + = 1 k = 1 2 Type 1 solutions:{ a = = 1/ 2, k = 1}, which resemle the Trapezoidal rule. Type 2 solutions:{ a = 0, =1, k = 2 }, which resemle the second-order Lax-Wendroff scheme. General solutions:{ = k / 2, a = 1 (k / 2), for all real numer k }. (C.82) (C.83) Exercise C.2 Find a fifth-order expression of y n+1 Let us assume a sixth-order expression of y n+1 y n+1 = y n + Δt[a f c + d f 4 + g f 5 ]+ O((Δt) 6 f (5) ) (C.84) where f 1 = f (t n, y n ) j, yn + Δt f 1 ) j k, yn + Δt k ) f 4 l, yn + Δt ) l f 5 m, yn + Δt m f 4 ) Please find possile solutions of a,,c,d,g, and j,k,l,m. (C.85) (C.86) (C.87) (C.88) (C.89) C-12

13 Exercise C.3 Find a sixth-order expression of y n+1 Let us assume a sixth-order expression of y n+1 y n+1 = y n + Δt[a f c + d f 4 + g f 5 + h f 6 ]+O((Δt) 7 f (6) ) (C.90) where f 1 = f (t n, y n ) j, yn + Δt f 1 ) j k, yn + Δt k ) f 4 l, yn + Δt ) l f 5 m, yn + Δt m f 4 ) f 6 p, yn + Δt p f 5 ) Please find possile solutions of a,,c,d,g,h, and j,k,l,m, p. (C.91) (C.92) (C.93) (C.94) (C.95) (C.96) C-13

14 C.3. Derivation of the Adams' Formulae Let dy / dt = f (y,t), y n = y(t = nδt), and [ f (k ) ] n = [d k f / dt k ] t=nδt. The Taylor series expansion of y n+1 is given y y n+1 = y n + hf n + h2 2! [ f (1) ] n + h3 3! [ f (2) ] n + h4 4! [ f (3) ] n hm m! [ f (m 1) ] n + O(h m+1 f (m) ) (C.97) For Adams' open formula, the m -th order expression of y n+1 can e written as y n+1 = y n + h[a 0 f n + a 1 f n 1 + +a 2 f n 2 + a 3 f n a (m 1) f n (m 1) ]+ O(h m+1 ) (C.98) For Adams close formula, the m -th order expression of y n+1 can e written as y n+1 = y n + h[ +1 f n f n + 1 f n f n (m 2) f n (m 2) ]+ O(h m+1 ) (C.99) The Taylor series expansions of f n+1, f n 1,.., f n (m 1) are given elow: f n+1 = f n + h[ f (1) ] n + h2 2! [ f (2) ] n + h3 3! [ f (3) ] n + h4 4! [ f (4) ] n hm 1 (m 1)! [ f (m 1) ] n + O(h m f (m) ) (C.100) f n 1 = f n h[ f (1) ] n + h2 2! [ f (2) ] n h3 3! [ f (3) ] n + h4 4! [ f (4) ] n ( h)m 1 (m 1)! [ f (m 1) ] n + O(h m f (m) ) (C.101) f n 2 = f n 2h[ f (1) ] n h 2 2! [ f (2) ] n 2 3 h 3 3! [ f (3) ] n ( 2h)m 1 (m 1)! [ f (m 1) ] n + O(h m f (m) ) (C.102) f n 3 = f n 3h[ f (1) ] n h 2 2! [ f (2) ] n 3 3 h 3 3! [ f (3) ] n ( 3h)m 1 (m 1)! [ f (m 1) ] n + O(h m f (m) ) (C.103) h 2 f n (m 2) = f n (m 2)h[ f (1) ] n + (m 2) 2 2! [ f h 3 (2) ] n (m 2) 3 3! [ f (3) ] n ( h) m (m 2) m 1 (m 1)! [ f (m 1) ] n + O(h m f (m) ) (C.104) C-14

15 h 2 f n (m 1) = f n (m 1)h[ f (1) ] n + (m 1) 2 2! [ f h 3 (2) ] n (m 1) 3 3! [ f (3) ] n ( h) m (m 1) m 1 (m 1)! [ f (m 1) ] n + O(h m f (m) ) (C.105) Sustituting Eqs. (C.101)~(C.105) into Eq. (C.98), and then comparing the coefficients of [ f (k ) ] n with the Eq. (C.97) it yields a 0 + a 1 + a 2 + a a (m 1) = 1 (C.106) (m 1) (m 1) (m 1) m 1 3 m 1 (m 1) m 1 a 1 a 2 a 3 a (m 1) = 1 / 2 +1 / 3 1 / 4 ( 1) m 1 / m (C.107) Sustituting Eqs. (C.100)~(C.104) into Eq. (C.99), and then comparing the coefficients of [ f (k ) ] n with the Eq. (C.97) it yields (m 2) = 1 (C.108) (m 2) (m 2) (m 2) 3 1 ( 1) m 1 ( 2) m 1 ( m + 2) m (m 2) 1/ 2 1/ 3 = 1/ 4 1/ m (C.109) Solutions of Eqs. (C.106) and (C.107) yield the Adams' open formulae as the ones shown in Tale C.2. Solutions of Eqs. (C.108) and (C.109) yield the Adams' close formulae as the ones shown in Tale C.3. Note that a different way to show the derivations of the Adams open and close formulae can e found in the textook y Hilderand (1976). C-15

16 Tale C.2. The nth order Adams' Open Formulae (also called Adams-Bashforth Formulae) Order of Solving dy /d t = f or y / t = f explicitly with h = Δt Accuracy 1 st y n +1 = y n + h[ f n ] + O(h 2 f (1) ) 2 nd y n +1 = y n + h[ 3 2 f n 1 2 f n 1 ] + O(h 3 f (2) ) 3 rd y n +1 = y n + h[ f n f n f n 2 ] + O(h 4 f (3) ) 4 th y n +1 = y n + h[ f n f n f n f n 3 ] + O(h 5 f (4) ) 5 th y n +1 = y n 6 th y n +1 = y n + h[ f n f n f n f n f n 4 ] + O(h 6 f (5) ) + h[ f n f n f n f n f n f n 5 ] + O(h 7 f (6) ) Tale C.3. The nth order Adams' Close Formulae (also called Adams-Moulton Formulae) Order of Solving dy /d t = f or y / t mplicitly with h = Δt Accuracy 1 st y n +1 = y n + h[ f n +1 ] + O(h 2 f (1) ) 2 nd y n +1 = y n + h[ 1 2 f n f n ] + O(h 3 f (2) ) 3 rd y n +1 = y n + h[ 5 12 f n f n 1 12 f n 1 ] + O(h 4 f (3) ) 4 th y n +1 = y n + h[ 9 24 f n f n 5 24 f n f n 2 ] + O(h 5 f (4) ) 5 th y n +1 = y n 6 th y n +1 = y n + h[ f n f n f n f n f n 3 ] + O(h 6 f (5) ) + h[ f n f n f n f n f n f n 4 ] + O(h 7 f (6) ) C-16

17 C.4. Derivation of the Open Formulae at half time steps For open formula, the m -th order expression of y n+1 can e written as y n+1 = y n + h[a 0.5 f n a 0.5 f n a 1.5 f n a 2.5 f n a (m 0.5) f n (m 0.5) ]+ O(h m+1 ) (C.110) The Taylor series expansions of f n+0.5, f n 0.5,.., f n (m 0.5) are given elow: f n+0.5 = f n + h 2 [ f (1) ] n h 2 2! [ f (2) ] n h m 1 h m 1 (m 1)! [ f (m 1) ] n + O(h m f (m) ) 3! [ f (3) ] n h 4 4! [ f (4) ] n (C.111) f n 0.5 = f n h 2 [ f (1) ] n h 2 2! [ f (2) ] n h m 1 ( h) m 1 (m 1)! [ f (m 1) ] n + O(h m f (m) ) 3! [ f (3) ] n h 4 4! [ f (4) ] n (C.112) f n 1.5 = f n 3 2 h[ f (1) ] n h 2 2! [ f (2) ] n h 3 3! [ f (3) ] n h 4 4! [ f (4) ] n m 1 2 m 1 ( h) m 1 (m 1)! [ f (m 1) ] n + O(h m f (m) ) (C.113) f n 2.5 = f n 5 2 h[ f (1) ] n h 2 2! [ f (2) ] n h 3 3! [ f (3) ] n h 4 4! [ f (4) ] n m 1 2 m 1 ( h) m 1 (m 1)! [ f (m 1) ] n + O(h m f (m) ) (C.114) h 2 f n (m 0.5) = f n (m 0.5)h[ f (1) ] n + (m 0.5) 2 2! [ f h 3 (2) ] n (m 0.5) 3 3! [ f (3) ] n ( h) m (m 0.5) m 1 (m 1)! [ f (m 1) ] n + O(h m f (m) ) (C.115) Sustituting Eqs. (C.111)~(C.115) into Eq. (C.110), and then comparing the coefficients of [ f (k ) ] n C-17

18 with the Eq. (C.97) it yields ! 1 1/ 2 1/ 2 3 / 2 5 / 2! (m 0.5) 1/ 2 2 1/ / / 2 2! (m 0.5) 2 1/ 2 3 1/ / / 2 3! (m 0.5) 3 "!!!! " 1/ 2 m 1 ( 1/ 2) m 1 ( 3 / 2) m 1 ( 5 / 2) m 1! [ (m 0.5)] m 1 a 0.5 a 0.5 a 1.5 a 2.5 " a (m 0.5) 1 1/ 2 = 1/ 3 1/ 4 " 1/ m (C.116) Solutions of Eqs. (C.116) are shown in Tale C.4. Order of Accuracy Tale C.4. The nth order Open Formulae at half time steps Solving dy /d t = f or y / t = f explicitly with h = Δt 2 nd y n+1 = y n + h[1 f n f n 0.5 ]+ O(h 3 f (2) ) 3 rd y n+1 = y n + h[ f n f n f n 1.5 ]+ O(h 4 f (3) ) 4 th y n+1 = y n + h[ f n f n f n f n 2.5 ]+ O(h 5 f (4) ) References Hilderand, F. B., Advanced Calculus for Applications, 2 nd edition, Prentice-Hall, Inc., Englewood, Cliffs, New Jersey, Press, W. H., B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling, Numerical Recipes (in C or in FORTRAN and Pascal), Camridge University Press, Camridge, Shampine, L. F., and M. K. Gordon, Computer Solution of Ordinary Differential Equation: the Initial Value Prolem, W. H. Freeman and Company, San Francisco, C-18

9.6 Predictor-Corrector Methods

9.6 Predictor-Corrector Methods SEC. 9.6 PREDICTOR-CORRECTOR METHODS 505 Adams-Bashforth-Moulton Method 9.6 Predictor-Corrector Methods The methods of Euler, Heun, Taylor, and Runge-Kutta are called single-step methods because they use

More information

Fourth Order RK-Method

Fourth Order RK-Method Fourth Order RK-Method The most commonly used method is Runge-Kutta fourth order method. The fourth order RK-method is y i+1 = y i + 1 6 (k 1 + 2k 2 + 2k 3 + k 4 ), Ordinary Differential Equations (ODE)

More information

ECE257 Numerical Methods and Scientific Computing. Ordinary Differential Equations

ECE257 Numerical Methods and Scientific Computing. Ordinary Differential Equations ECE257 Numerical Methods and Scientific Computing Ordinary Differential Equations Today s s class: Stiffness Multistep Methods Stiff Equations Stiffness occurs in a problem where two or more independent

More information

Numerical Differential Equations: IVP

Numerical Differential Equations: IVP Chapter 11 Numerical Differential Equations: IVP **** 4/16/13 EC (Incomplete) 11.1 Initial Value Problem for Ordinary Differential Equations We consider the problem of numerically solving a differential

More information

Differential Equations

Differential Equations Differential Equations Definitions Finite Differences Taylor Series based Methods: Euler Method Runge-Kutta Methods Improved Euler, Midpoint methods Runge Kutta (2nd, 4th order) methods Predictor-Corrector

More information

COSC 3361 Numerical Analysis I Ordinary Differential Equations (II) - Multistep methods

COSC 3361 Numerical Analysis I Ordinary Differential Equations (II) - Multistep methods COSC 336 Numerical Analysis I Ordinary Differential Equations (II) - Multistep methods Fall 2005 Repetition from the last lecture (I) Initial value problems: dy = f ( t, y) dt y ( a) = y 0 a t b Goal:

More information

Initial-Value Problems for ODEs. Introduction to Linear Multistep Methods

Initial-Value Problems for ODEs. Introduction to Linear Multistep Methods Initial-Value Problems for ODEs Introduction to Linear Multistep Methods Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University

More information

multistep methods Last modified: November 28, 2017 Recall that we are interested in the numerical solution of the initial value problem (IVP):

multistep methods Last modified: November 28, 2017 Recall that we are interested in the numerical solution of the initial value problem (IVP): MATH 351 Fall 217 multistep methods http://www.phys.uconn.edu/ rozman/courses/m351_17f/ Last modified: November 28, 217 Recall that we are interested in the numerical solution of the initial value problem

More information

Euler s Method, cont d

Euler s Method, cont d Jim Lambers MAT 461/561 Spring Semester 009-10 Lecture 3 Notes These notes correspond to Sections 5. and 5.4 in the text. Euler s Method, cont d We conclude our discussion of Euler s method with an example

More information

Mathematics for chemical engineers. Numerical solution of ordinary differential equations

Mathematics for chemical engineers. Numerical solution of ordinary differential equations Mathematics for chemical engineers Drahoslava Janovská Numerical solution of ordinary differential equations Initial value problem Winter Semester 2015-2016 Outline 1 Introduction 2 One step methods Euler

More information

Applied Math for Engineers

Applied Math for Engineers Applied Math for Engineers Ming Zhong Lecture 15 March 28, 2018 Ming Zhong (JHU) AMS Spring 2018 1 / 28 Recap Table of Contents 1 Recap 2 Numerical ODEs: Single Step Methods 3 Multistep Methods 4 Method

More information

16.7 Multistep, Multivalue, and Predictor-Corrector Methods

16.7 Multistep, Multivalue, and Predictor-Corrector Methods 740 Chapter 16. Integration of Ordinary Differential Equations 16.7 Multistep, Multivalue, and Predictor-Corrector Methods The terms multistepand multivaluedescribe two different ways of implementing essentially

More information

Consistency and Convergence

Consistency and Convergence Jim Lambers MAT 77 Fall Semester 010-11 Lecture 0 Notes These notes correspond to Sections 1.3, 1.4 and 1.5 in the text. Consistency and Convergence We have learned that the numerical solution obtained

More information

Comparison of Numerical Ordinary Differential Equation Solvers

Comparison of Numerical Ordinary Differential Equation Solvers Adrienne Criss Due: October, 008 Comparison of Numerical Ordinary Differential Equation Solvers Many interesting physical systems can be modeled by ordinary differential equations (ODEs). Since it is always

More information

Lecture Notes on Numerical Differential Equations: IVP

Lecture Notes on Numerical Differential Equations: IVP Lecture Notes on Numerical Differential Equations: IVP Professor Biswa Nath Datta Department of Mathematical Sciences Northern Illinois University DeKalb, IL. 60115 USA E mail: dattab@math.niu.edu URL:

More information

Do not turn over until you are told to do so by the Invigilator.

Do not turn over until you are told to do so by the Invigilator. UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 216 17 INTRODUCTION TO NUMERICAL ANALYSIS MTHE712B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.

More information

Numerical Methods for the Solution of Differential Equations

Numerical Methods for the Solution of Differential Equations Numerical Methods for the Solution of Differential Equations Markus Grasmair Vienna, winter term 2011 2012 Analytical Solutions of Ordinary Differential Equations 1. Find the general solution of the differential

More information

Lecture 2: Numerical Methods for Differentiations and Integrations

Lecture 2: Numerical Methods for Differentiations and Integrations Numercal Smulaton of Space Plasmas (I [AP-4036] Lecture 2 by Lng-Hsao Lyu March, 2018 Lecture 2: Numercal Methods for Dfferentatons and Integratons As we have dscussed n Lecture 1 that numercal smulaton

More information

Solutions to Exam 2, Math 10560

Solutions to Exam 2, Math 10560 Solutions to Exam, Math 6. Which of the following expressions gives the partial fraction decomposition of the function x + x + f(x = (x (x (x +? Solution: Notice that (x is not an irreducile factor. If

More information

16.7 Multistep, Multivalue, and Predictor-Corrector Methods

16.7 Multistep, Multivalue, and Predictor-Corrector Methods 16.7 Multistep, Multivalue, and Predictor-Corrector Methods 747 } free_vector(ysav,1,nv); free_vector(yerr,1,nv); free_vector(x,1,kmaxx); free_vector(err,1,kmaxx); free_matrix(dfdy,1,nv,1,nv); free_vector(dfdx,1,nv);

More information

Lecture 4: Numerical solution of ordinary differential equations

Lecture 4: Numerical solution of ordinary differential equations Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor

More information

Solution of First Order Initial Value Problem by Sixth Order Predictor Corrector Method

Solution of First Order Initial Value Problem by Sixth Order Predictor Corrector Method Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 6 (2017), pp. 2277 2290 Research India Publications http://www.ripublication.com/gjpam.htm Solution of First Order Initial

More information

Review Higher Order methods Multistep methods Summary HIGHER ORDER METHODS. P.V. Johnson. School of Mathematics. Semester

Review Higher Order methods Multistep methods Summary HIGHER ORDER METHODS. P.V. Johnson. School of Mathematics. Semester HIGHER ORDER METHODS School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE

More information

Variable Step Size Differential Equation Solvers

Variable Step Size Differential Equation Solvers Math55: Differential Equations 1/30 Variable Step Size Differential Equation Solvers Jason Brewer and George Little Introduction The purpose of developing numerical methods is to approximate the solution

More information

FORTRAN 77 Lesson 7. Reese Haywood Ayan Paul

FORTRAN 77 Lesson 7. Reese Haywood Ayan Paul FORTRAN 77 Lesson 7 Reese Haywood Ayan Paul 1 Numerical Integration A general all purpose Numerical Integration technique is the Trapezoidal Method. For most functions, this method is fast and accurate.

More information

Jim Lambers MAT 772 Fall Semester Lecture 21 Notes

Jim Lambers MAT 772 Fall Semester Lecture 21 Notes Jim Lambers MAT 772 Fall Semester 21-11 Lecture 21 Notes These notes correspond to Sections 12.6, 12.7 and 12.8 in the text. Multistep Methods All of the numerical methods that we have developed for solving

More information

Initial value problems for ordinary differential equations

Initial value problems for ordinary differential equations Initial value problems for ordinary differential equations Xiaojing Ye, Math & Stat, Georgia State University Spring 2019 Numerical Analysis II Xiaojing Ye, Math & Stat, Georgia State University 1 IVP

More information

Ordinary Differential Equations

Ordinary Differential Equations Chapter 7 Ordinary Differential Equations Differential equations are an extremely important tool in various science and engineering disciplines. Laws of nature are most often expressed as different equations.

More information

A.1 THE SAMPLED TIME DOMAIN AND THE Z TRANSFORM. 0 δ(t)dt = 1, (A.1) δ(t)dt =

A.1 THE SAMPLED TIME DOMAIN AND THE Z TRANSFORM. 0 δ(t)dt = 1, (A.1) δ(t)dt = APPENDIX A THE Z TRANSFORM One of the most useful techniques in engineering or scientific analysis is transforming a problem from the time domain to the frequency domain ( 3). Using a Fourier or Laplace

More information

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK KINGS COLLEGE OF ENGINEERING MA5-NUMERICAL METHODS DEPARTMENT OF MATHEMATICS ACADEMIC YEAR 00-0 / EVEN SEMESTER QUESTION BANK SUBJECT NAME: NUMERICAL METHODS YEAR/SEM: II / IV UNIT - I SOLUTION OF EQUATIONS

More information

Ordinary Differential Equations

Ordinary Differential Equations Ordinary Differential Equations We call Ordinary Differential Equation (ODE) of nth order in the variable x, a relation of the kind: where L is an operator. If it is a linear operator, we call the equation

More information

You may not use your books, notes; calculators are highly recommended.

You may not use your books, notes; calculators are highly recommended. Math 301 Winter 2013-14 Midterm 1 02/06/2014 Time Limit: 60 Minutes Name (Print): Instructor This exam contains 8 pages (including this cover page) and 6 problems. Check to see if any pages are missing.

More information

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 1. Runge-Kutta Methods

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 1. Runge-Kutta Methods Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Mathematics National Institute of Technology Durgapur Durgapur-71309 email: anita.buie@gmail.com 1 . Chapter 8 Numerical Solution of

More information

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University Part 6 Chapter 20 Initial-Value Problems PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction

More information

Numerical Methods - Initial Value Problems for ODEs

Numerical Methods - Initial Value Problems for ODEs Numerical Methods - Initial Value Problems for ODEs Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Initial Value Problems for ODEs 2013 1 / 43 Outline 1 Initial Value

More information

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University Part 6 Chapter 20 Initial-Value Problems PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction

More information

Integration of Ordinary Differential Equations

Integration of Ordinary Differential Equations Integration of Ordinary Differential Equations Com S 477/577 Nov 7, 00 1 Introduction The solution of differential equations is an important problem that arises in a host of areas. Many differential equations

More information

Solving Ordinary Differential equations

Solving Ordinary Differential equations Solving Ordinary Differential equations Taylor methods can be used to build explicit methods with higher order of convergence than Euler s method. The main difficult of these methods is the computation

More information

NUMERICAL ANALYSIS SYLLABUS MATHEMATICS PAPER IV (A)

NUMERICAL ANALYSIS SYLLABUS MATHEMATICS PAPER IV (A) NUMERICAL ANALYSIS SYLLABUS MATHEMATICS PAPER IV (A) Unit - 1 Errors & Their Accuracy Solutions of Algebraic and Transcendental Equations Bisection Method The method of false position The iteration method

More information

Ordinary differential equations - Initial value problems

Ordinary differential equations - Initial value problems Education has produced a vast population able to read but unable to distinguish what is worth reading. G.M. TREVELYAN Chapter 6 Ordinary differential equations - Initial value problems In this chapter

More information

Virtual University of Pakistan

Virtual University of Pakistan Virtual University of Pakistan File Version v.0.0 Prepared For: Final Term Note: Use Table Of Content to view the Topics, In PDF(Portable Document Format) format, you can check Bookmarks menu Disclaimer:

More information

AP Calculus Testbank (Chapter 9) (Mr. Surowski)

AP Calculus Testbank (Chapter 9) (Mr. Surowski) AP Calculus Testbank (Chapter 9) (Mr. Surowski) Part I. Multiple-Choice Questions n 1 1. The series will converge, provided that n 1+p + n + 1 (A) p > 1 (B) p > 2 (C) p >.5 (D) p 0 2. The series

More information

DIFFERENTIAL EQUATIONS

DIFFERENTIAL EQUATIONS DIFFERENTIAL EQUATIONS Chapter 1 Introduction and Basic Terminology Most of the phenomena studied in the sciences and engineering involve processes that change with time. For example, it is well known

More information

The Initial Value Problem for Ordinary Differential Equations

The Initial Value Problem for Ordinary Differential Equations Chapter 5 The Initial Value Problem for Ordinary Differential Equations In this chapter we begin a study of time-dependent differential equations, beginning with the initial value problem (IVP) for a time-dependent

More information

Ordinary Differential equations

Ordinary Differential equations Chapter 1 Ordinary Differential equations 1.1 Introduction to Ordinary Differential equation In mathematics, an ordinary differential equation (ODE) is an equation which contains functions of only one

More information

Applied Numerical Analysis

Applied Numerical Analysis Applied Numerical Analysis Using MATLAB Second Edition Laurene V. Fausett Texas A&M University-Commerce PEARSON Prentice Hall Upper Saddle River, NJ 07458 Contents Preface xi 1 Foundations 1 1.1 Introductory

More information

Do not turn over until you are told to do so by the Invigilator.

Do not turn over until you are told to do so by the Invigilator. UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 216 17 INTRODUCTION TO NUMERICAL ANALYSIS MTHE612B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.

More information

Solving PDEs with PGI CUDA Fortran Part 4: Initial value problems for ordinary differential equations

Solving PDEs with PGI CUDA Fortran Part 4: Initial value problems for ordinary differential equations Solving PDEs with PGI CUDA Fortran Part 4: Initial value problems for ordinary differential equations Outline ODEs and initial conditions. Explicit and implicit Euler methods. Runge-Kutta methods. Multistep

More information

Numerical Methods for Differential Equations

Numerical Methods for Differential Equations Numerical Methods for Differential Equations Chapter 2: Runge Kutta and Multistep Methods Gustaf Söderlind Numerical Analysis, Lund University Contents V4.16 1. Runge Kutta methods 2. Embedded RK methods

More information

1 Error Analysis for Solving IVP

1 Error Analysis for Solving IVP cs412: introduction to numerical analysis 12/9/10 Lecture 25: Numerical Solution of Differential Equations Error Analysis Instructor: Professor Amos Ron Scribes: Yunpeng Li, Mark Cowlishaw, Nathanael Fillmore

More information

Chapter 5 Exercises. (a) Determine the best possible Lipschitz constant for this function over 2 u <. u (t) = log(u(t)), u(0) = 2.

Chapter 5 Exercises. (a) Determine the best possible Lipschitz constant for this function over 2 u <. u (t) = log(u(t)), u(0) = 2. Chapter 5 Exercises From: Finite Difference Methods for Ordinary and Partial Differential Equations by R. J. LeVeque, SIAM, 2007. http://www.amath.washington.edu/ rjl/fdmbook Exercise 5. (Uniqueness for

More information

Physics 584 Computational Methods

Physics 584 Computational Methods Physics 584 Computational Methods Introduction to Matlab and Numerical Solutions to Ordinary Differential Equations Ryan Ogliore April 18 th, 2016 Lecture Outline Introduction to Matlab Numerical Solutions

More information

Numerical Methods in Physics and Astrophysics

Numerical Methods in Physics and Astrophysics Kostas Kokkotas 2 October 17, 2017 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation

More information

Computational Methods

Computational Methods Numerical Computational Methods Revised Edition P. B. Patil U. P. Verma Alpha Science International Ltd. Oxford, U.K. CONTENTS Preface List ofprograms v vii 1. NUMER1CAL METHOD, ERROR AND ALGORITHM 1 1.1

More information

A Brief Introduction to Numerical Methods for Differential Equations

A Brief Introduction to Numerical Methods for Differential Equations A Brief Introduction to Numerical Methods for Differential Equations January 10, 2011 This tutorial introduces some basic numerical computation techniques that are useful for the simulation and analysis

More information

Math 128A Spring 2003 Week 11 Solutions Burden & Faires 5.6: 1b, 3b, 7, 9, 12 Burden & Faires 5.7: 1b, 3b, 5 Burden & Faires 5.

Math 128A Spring 2003 Week 11 Solutions Burden & Faires 5.6: 1b, 3b, 7, 9, 12 Burden & Faires 5.7: 1b, 3b, 5 Burden & Faires 5. Math 128A Spring 2003 Week 11 Solutions Burden & Faires 5.6: 1b, 3b, 7, 9, 12 Burden & Faires 5.7: 1b, 3b, 5 Burden & Faires 5.8: 1b, 3b, 4 Burden & Faires 5.6. Multistep Methods 1. Use all the Adams-Bashforth

More information

Fourier transforms of molecular vibrations

Fourier transforms of molecular vibrations Fourier transforms of molecular vibrations Part I: An Introduction to the Harmonic Oscillator and Fourier Transforms W. Tandy Grubbs, Department of Chemistry, Unit 827, Stetson University, DeLand, FL 32720

More information

Taylor Series and stationary points

Taylor Series and stationary points Chapter 5 Taylor Series and stationary points 5.1 Taylor Series The surface z = f(x, y) and its derivatives can give a series approximation for f(x, y) about some point (x 0, y 0 ) as illustrated in Figure

More information

Vectors and Matrices

Vectors and Matrices Chapter Vectors and Matrices. Introduction Vectors and matrices are used extensively throughout this text. Both are essential as one cannot derive and analyze laws of physics and physical measurements

More information

New Third Order Runge Kutta Based on Contraharmonic Mean for Stiff Problems

New Third Order Runge Kutta Based on Contraharmonic Mean for Stiff Problems Applied Mathematical Sciences, Vol., 2009, no. 8, 65-76 New Third Order Runge Kutta Based on Contraharmonic Mean for Stiff Problems Osama Yusuf Ababneh 1 and Rokiah Rozita School of Mathematical Sciences

More information

Ordinary differential equations. Phys 420/580 Lecture 8

Ordinary differential equations. Phys 420/580 Lecture 8 Ordinary differential equations Phys 420/580 Lecture 8 Most physical laws are expressed as differential equations These come in three flavours: initial-value problems boundary-value problems eigenvalue

More information

Linear Multistep Methods I: Adams and BDF Methods

Linear Multistep Methods I: Adams and BDF Methods Linear Multistep Methods I: Adams and BDF Methods Varun Shankar January 1, 016 1 Introduction In our review of 5610 material, we have discussed polynomial interpolation and its application to generating

More information

Finite Differences for Differential Equations 28 PART II. Finite Difference Methods for Differential Equations

Finite Differences for Differential Equations 28 PART II. Finite Difference Methods for Differential Equations Finite Differences for Differential Equations 28 PART II Finite Difference Methods for Differential Equations Finite Differences for Differential Equations 29 BOUNDARY VALUE PROBLEMS (I) Solving a TWO

More information

Ordinary Differential Equations

Ordinary Differential Equations CHAPTER 8 Ordinary Differential Equations 8.1. Introduction My section 8.1 will cover the material in sections 8.1 and 8.2 in the book. Read the book sections on your own. I don t like the order of things

More information

Solving Ordinary Differential Equations

Solving Ordinary Differential Equations Solving Ordinary Differential Equations Sanzheng Qiao Department of Computing and Software McMaster University March, 2014 Outline 1 Initial Value Problem Euler s Method Runge-Kutta Methods Multistep Methods

More information

2.1 NUMERICAL SOLUTION OF SIMULTANEOUS FIRST ORDER ORDINARY DIFFERENTIAL EQUATIONS. differential equations with the initial values y(x 0. ; l.

2.1 NUMERICAL SOLUTION OF SIMULTANEOUS FIRST ORDER ORDINARY DIFFERENTIAL EQUATIONS. differential equations with the initial values y(x 0. ; l. Numerical Methods II UNIT.1 NUMERICAL SOLUTION OF SIMULTANEOUS FIRST ORDER ORDINARY DIFFERENTIAL EQUATIONS.1.1 Runge-Kutta Method of Fourth Order 1. Let = f x,y,z, = gx,y,z be the simultaneous first order

More information

Name of the Student: Unit I (Solution of Equations and Eigenvalue Problems)

Name of the Student: Unit I (Solution of Equations and Eigenvalue Problems) Engineering Mathematics 8 SUBJECT NAME : Numerical Methods SUBJECT CODE : MA6459 MATERIAL NAME : University Questions REGULATION : R3 UPDATED ON : November 7 (Upto N/D 7 Q.P) (Scan the above Q.R code for

More information

CS 450 Numerical Analysis. Chapter 9: Initial Value Problems for Ordinary Differential Equations

CS 450 Numerical Analysis. Chapter 9: Initial Value Problems for Ordinary Differential Equations Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80

More information

Numerical Methods in Physics and Astrophysics

Numerical Methods in Physics and Astrophysics Kostas Kokkotas 2 October 20, 2014 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation

More information

(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by

(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by 1. QUESTION (a) Given a nth degree Taylor polynomial P n (x) of a function f(x), expanded about x = x 0, write down the Lagrange formula for the truncation error, carefully defining all its elements. How

More information

Euler s Method, Taylor Series Method, Runge Kutta Methods, Multi-Step Methods and Stability.

Euler s Method, Taylor Series Method, Runge Kutta Methods, Multi-Step Methods and Stability. Euler s Method, Taylor Series Method, Runge Kutta Methods, Multi-Step Methods and Stability. REVIEW: We start with the differential equation dy(t) dt = f (t, y(t)) (1.1) y(0) = y 0 This equation can be

More information

4.4 Computing π, ln 2 and e

4.4 Computing π, ln 2 and e 252 4.4 Computing π, ln 2 and e The approximations π 3.1415927, ln 2 0.69314718, e 2.7182818 can be obtained by numerical methods applied to the following initial value problems: (1) y = 4, 1 + x2 y(0)

More information

NUMERICAL SOLUTION OF ODE IVPs. Overview

NUMERICAL SOLUTION OF ODE IVPs. Overview NUMERICAL SOLUTION OF ODE IVPs 1 Quick review of direction fields Overview 2 A reminder about and 3 Important test: Is the ODE initial value problem? 4 Fundamental concepts: Euler s Method 5 Fundamental

More information

NORTH MAHARASHTRA UNIVERSITY JALGAON.

NORTH MAHARASHTRA UNIVERSITY JALGAON. NORTH MAHARASHTRA UNIVERSITY JALGAON. Syllabus for S.Y.B.Sc. (Mathematics) With effect from June 013. (Semester system). The pattern of examination of theory papers is semester system. Each theory course

More information

IMPLICIT INTERVAL MULTISTEP METHODS FOR SOLVING THE INITIAL VALUE PROBLEM

IMPLICIT INTERVAL MULTISTEP METHODS FOR SOLVING THE INITIAL VALUE PROBLEM COMPUTATIONAL METHODS IN SCIENCE AND TECHNOLOGY 8 (1), 17-30 (2002) IMPLICIT INTERVAL MULTISTEP METHODS FOR SOLVING THE INITIAL VALUE PROBLEM MAŁGORZATA JANKOWSKA 1, ANDRZEJ MARCINIAK 1,2 1 Poznań University

More information

Math 104: l Hospital s rule, Differential Equations and Integration

Math 104: l Hospital s rule, Differential Equations and Integration Math 104: l Hospital s rule, and Integration Ryan Blair University of Pennsylvania Tuesday January 22, 2013 Math 104:l Hospital s rule, andtuesday Integration January 22, 2013 1 / 8 Outline 1 l Hospital

More information

Numerical solution of ODEs

Numerical solution of ODEs Numerical solution of ODEs Arne Morten Kvarving Department of Mathematical Sciences Norwegian University of Science and Technology November 5 2007 Problem and solution strategy We want to find an approximation

More information

On A General Formula of Fourth Order Runge-Kutta Method

On A General Formula of Fourth Order Runge-Kutta Method On A General Formula of Fourth Order Runge-Kutta Method Delin Tan Zheng Chen Abstract In this paper we obtain a general formula of Runge-Kutta method in order with a free parameter t By picking the value

More information

8.1 Introduction. Consider the initial value problem (IVP):

8.1 Introduction. Consider the initial value problem (IVP): 8.1 Introduction Consider the initial value problem (IVP): y dy dt = f(t, y), y(t 0)=y 0, t 0 t T. Geometrically: solutions are a one parameter family of curves y = y(t) in(t, y)-plane. Assume solution

More information

16.1 Runge-Kutta Method

16.1 Runge-Kutta Method 704 Chapter 6. Integration of Ordinary Differential Equations CITED REFERENCES AND FURTHER READING: Gear, C.W. 97, Numerical Initial Value Problems in Ordinary Differential Equations (Englewood Cliffs,

More information

Numerical Solution of Differential Equations

Numerical Solution of Differential Equations 1 Numerical Solution of Differential Equations A differential equation (or "DE") contains derivatives or differentials. In a differential equation the unknown is a function, and the differential equation

More information

HIGHER ORDER METHODS. There are two principal means to derive higher order methods. b j f(x n j,y n j )

HIGHER ORDER METHODS. There are two principal means to derive higher order methods. b j f(x n j,y n j ) HIGHER ORDER METHODS There are two principal means to derive higher order methods y n+1 = p j=0 a j y n j + h p j= 1 b j f(x n j,y n j ) (a) Method of Undetermined Coefficients (b) Numerical Integration

More information

Exponential Integrators

Exponential Integrators Exponential Integrators John C. Bowman and Malcolm Roberts (University of Alberta) June 11, 2009 www.math.ualberta.ca/ bowman/talks 1 Outline Exponential Integrators Exponential Euler History Generalizations

More information

Previous Year Questions & Detailed Solutions

Previous Year Questions & Detailed Solutions Previous Year Questions & Detailed Solutions. The rate of convergence in the Gauss-Seidal method is as fast as in Gauss Jacobi smethod ) thrice ) half-times ) twice 4) three by two times. In application

More information

Scientific Computing with Case Studies SIAM Press, Lecture Notes for Unit V Solution of

Scientific Computing with Case Studies SIAM Press, Lecture Notes for Unit V Solution of Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit V Solution of Differential Equations Part 1 Dianne P. O Leary c 2008 1 The

More information

Math Numerical Analysis Homework #4 Due End of term. y = 2y t 3y2 t 3, 1 t 2, y(1) = 1. n=(b-a)/h+1; % the number of steps we need to take

Math Numerical Analysis Homework #4 Due End of term. y = 2y t 3y2 t 3, 1 t 2, y(1) = 1. n=(b-a)/h+1; % the number of steps we need to take Math 32 - Numerical Analysis Homework #4 Due End of term Note: In the following y i is approximation of y(t i ) and f i is f(t i,y i ).. Consider the initial value problem, y = 2y t 3y2 t 3, t 2, y() =.

More information

PH36010: Numerical Methods - Evaluating the Lorenz Attractor using Runge-Kutta methods Abstract

PH36010: Numerical Methods - Evaluating the Lorenz Attractor using Runge-Kutta methods Abstract PH36010: Numerical Methods - Evaluating the Lorenz Attractor using Runge-Kutta methods Mr. Benjamen P. Reed (110108461) IMPACS, Aberystwyth University January 31, 2014 Abstract A set of three coupled ordinary

More information

Ordinary Differential Equations II

Ordinary Differential Equations II Ordinary Differential Equations II CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Ordinary Differential Equations II 1 / 29 Almost Done! No

More information

INTRODUCTION TO COMPUTER METHODS FOR O.D.E.

INTRODUCTION TO COMPUTER METHODS FOR O.D.E. INTRODUCTION TO COMPUTER METHODS FOR O.D.E. 0. Introduction. The goal of this handout is to introduce some of the ideas behind the basic computer algorithms to approximate solutions to differential equations.

More information

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 2. Predictor-Corrector Methods

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 2. Predictor-Corrector Methods Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Matematics National Institute of Tecnology Durgapur Durgapur-7109 email: anita.buie@gmail.com 1 . Capter 8 Numerical Solution of Ordinary

More information

Use of Differential Equations In Modeling and Simulation of CSTR

Use of Differential Equations In Modeling and Simulation of CSTR Use of Differential Equations In Modeling and Simulation of CSTR JIRI VOJTESEK, PETR DOSTAL Department of Process Control, Faculty of Applied Informatics Tomas Bata University in Zlin nám. T. G. Masaryka

More information

-Stable Second Derivative Block Multistep Formula for Stiff Initial Value Problems

-Stable Second Derivative Block Multistep Formula for Stiff Initial Value Problems IAENG International Journal of Applied Mathematics, :3, IJAM 3_7 -Stable Second Derivative Bloc Multistep Formula for Stiff Initial Value Problems (Advance online publication: 3 August ) IAENG International

More information

Numerical methods. Lecture notes. Prof. Dr. W. Benz

Numerical methods. Lecture notes. Prof. Dr. W. Benz Numerical methods Lecture notes Prof. Dr. W. Benz Bern, February 008 Contents 1 Basics 5 1.1 Introduction................................. 5 1. Variables, functions and derivatives....................

More information

Numerical Analysis Exam with Solutions

Numerical Analysis Exam with Solutions Numerical Analysis Exam with Solutions Richard T. Bumby Fall 000 June 13, 001 You are expected to have books, notes and calculators available, but computers of telephones are not to be used during the

More information

Practice Exam 2 (Solutions)

Practice Exam 2 (Solutions) Math 5, Fall 7 Practice Exam (Solutions). Using the points f(x), f(x h) and f(x + h) we want to derive an approximation f (x) a f(x) + a f(x h) + a f(x + h). (a) Write the linear system that you must solve

More information

Lie s Symmetries of (2+1)dim PDE

Lie s Symmetries of (2+1)dim PDE International Journal of Mathematics Trends and Technology (IJMTT) - Volume 5 Numer 6 Novemer 7 Lie s Symmetries of (+)dim PDE S. Padmasekaran and S. Rajeswari Department of Mathematics Periyar University

More information

Computational Methods CMSC/AMSC/MAPL 460. Ordinary differential equations

Computational Methods CMSC/AMSC/MAPL 460. Ordinary differential equations /0/0 Computational Methods CMSC/AMSC/MAPL 460 Ordinar differential equations Ramani Duraiswami Dept. of Computer Science Several slides adapted from Profs. Dianne O Lear and Eric Sandt TAMU Higher Order

More information

Numerical Methods for Engineers. and Scientists. Applications using MATLAB. An Introduction with. Vish- Subramaniam. Third Edition. Amos Gilat.

Numerical Methods for Engineers. and Scientists. Applications using MATLAB. An Introduction with. Vish- Subramaniam. Third Edition. Amos Gilat. Numerical Methods for Engineers An Introduction with and Scientists Applications using MATLAB Third Edition Amos Gilat Vish- Subramaniam Department of Mechanical Engineering The Ohio State University Wiley

More information

5.2 - Euler s Method

5.2 - Euler s Method 5. - Euler s Method Consider solving the initial-value problem for ordinary differential equation: (*) y t f t, y, a t b, y a. Let y t be the unique solution of the initial-value problem. In the previous

More information

Initial value problems for ordinary differential equations

Initial value problems for ordinary differential equations AMSC/CMSC 660 Scientific Computing I Fall 2008 UNIT 5: Numerical Solution of Ordinary Differential Equations Part 1 Dianne P. O Leary c 2008 The Plan Initial value problems (ivps) for ordinary differential

More information