This preview shows pages 1–10. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: RungeKutta methods Systems of ODEs Timestepping for systems OneStep Methods Dhavide Aruliah UOIT MATH 2070U c D. Aruliah (UOIT) OneStep Methods MATH 2070U 1 / 35 RungeKutta methods Systems of ODEs Timestepping for systems OneStep Methods 1 RungeKutta methods 2 Systems of ordinary differential equations Higherorder ODEs and 1 storder systems 3 Timestepping methods for 1 storder IVP systems c D. Aruliah (UOIT) OneStep Methods MATH 2070U 2 / 35 RungeKutta methods Systems of ODEs Timestepping for systems RungeKutta methods Observe various methods can be expressed as y i + 1 = y i + h φ where φ is an increment function Euler’s method k 1 = f ( t i , y i ) , y i + 1 = y i + hk 1 General form of increment function is φ = a 1 k 1 + a 2 k 2 + ··· + a s k s where { a j } s j = 1 are constants and { k j } s j = 1 are slopes c D. Aruliah (UOIT) OneStep Methods MATH 2070U 4 / 35 RungeKutta methods Systems of ODEs Timestepping for systems RungeKutta methods Generic explicit RungeKutta methods are of the form k 1 = f ( t i , y i ) k 2 = f ( t i + p 1 h , y i + q 11 k 1 h ) k 3 = f ( t i + p 2 h , y i + q 21 k 1 h + q 22 k 2 h ) . . . k s = f ( t i + p s 1 h , y i + q s 1,1 k 1 h + q s 1,2 k 2 h + ··· + q s 1, s 1 k s 1 h ) y i + 1 = y i + h ( a 1 k 1 + a 2 k 2 + ··· + a s k s ) Specific coefficients derived using Taylor series to generate formulas of prescribed accuracies c D. Aruliah (UOIT) OneStep Methods MATH 2070U 5 / 35 RungeKutta methods Systems of ODEs Timestepping for systems RungeKutta methods of order 2 Generic 2stage method is k 1 = f ( t i , y i ) , k 2 = f ( t i + p 1 h , y i + q 11 k 1 h ) , y i + 1 = y i + h ( a 1 k 1 + a 2 k 2 ) Infinitely many 2stage secondorder accurate methods determined by equations a 1 = 1 a 2 , p 1 = 1 2 a 2 , q 11 = 1 2 a 2 c D. Aruliah (UOIT) OneStep Methods MATH 2070U 6 / 35 RungeKutta methods Systems of ODEs Timestepping for systems RungeKutta methods of order 2 Heun’s method ( a 2 = 1/2) k 1 = f ( t i , y i ) , k 2 = f ( t i + h , y i + hk 1 ) , y i + 1 = y i + h 2 ( k 1 + k 2 ) Midpoint method ( a 2 = 1) k 1 = f ( t i , y i ) , k 2 = f t i + h 2 , y i + h 2 k 1 , y i + 1 = y i + hk 2 Ralston’s method ( a 2 = 2/3) k 1 = f ( t i , y i ) , k 2 = f t i + 3 4 h , y i + 3 h 4 k 1 , y i + 1 = y i + h 2 ( k 1 + k 2 ) c D. Aruliah (UOIT) OneStep Methods MATH 2070U 7 / 35 RungeKutta methods Systems of ODEs Timestepping for systems Classical RungeKutta method of order 4 RK4 (Classical RungeKutta method of order 4) k 1 = f ( t i , y i ) , k 2 = f t i + h 2 , y i + h 2 k 1 , k 3 = f t i + h 2 , y i + h 2 k 2 , k 4 = f ( t i + h , y i + hk 3 ) , y i + 1 = y i + h 6 ( k 1 + 2 k 2 + 2 k 3 + k 4 ) (RK4) c D. Aruliah (UOIT) OneStep Methods MATH 2070U 8 / 35 RungeKutta methods Systems of ODEs Timestepping for systems c D. Aruliah (UOIT) OneStep Methods MATH 2070U 9 / 35 RungeKutta methods Systems of ODEs Timestepping for systems Example of Classical RungeKutta (RK4) Given the IVP...
View
Full
Document
This note was uploaded on 06/20/2011 for the course MATH 2070 taught by Professor Aruliahdhavidhe during the Winter '10 term at UOIT.
 Winter '10
 aruliahdhavidhe
 Math

Click to edit the document details