28-Higher Order Methods

28-Higher Order - Runge-Kutta methods Multistep methods Predictor-corrector methods Higher-Order Methods Dhavide Aruliah UOIT MATH 2070U c D

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Runge-Kutta methods Multistep methods Predictor-corrector methods Higher-Order Methods Dhavide Aruliah UOIT MATH 2070U c D. Aruliah (UOIT) Higher-Order Methods MATH 2070U 1 / 19 Runge-Kutta methods Multistep methods Predictor-corrector methods Higher-Order Methods 1 Runge-Kutta methods 2 Multistep methods 3 Predictor-corrector methods c D. Aruliah (UOIT) Higher-Order Methods MATH 2070U 2 / 19 Runge-Kutta methods Multistep methods Predictor-corrector methods Reminder: Numerical solution of IVPs IVP y = f ( t , y ( t )) , t I , y ( t ) = y . Mesh t < t 1 < < t N h with step-size h t n = t + nh ( n = 0: N h ) Numerical solution: { un } N h n = such that u n ' y ( t n ) Time-stepping: using recurrence to compute u n + 1 from u n ( n = 0: N h- 1); u = y c D. Aruliah (UOIT) Higher-Order Methods MATH 2070U 3 / 19 Runge-Kutta methods Multistep methods Predictor-corrector methods Reminder: Some one-step methods Prototypical one-step methods for time-stepping: u n + 1 = u n + h f n forward Euler (explicit) u n + 1 = u n + h f n + 1 backward Euler (implicit) u n + 1 = u n + h 2 ( f n + f n + 1 ) Crank-Nicolson (implicit) Errors: local e n = y ( t n )- u n , global max n N h | e n | Accuracy of discretisations measured by convergence of errors I Forward Euler: global error = O ( h ) I Backward Euler: global error = O ( h ) I Crank-Nicolson: global error = O ( h 2 ) c D. Aruliah (UOIT) Higher-Order Methods MATH 2070U 4 / 19 Runge-Kutta methods Multistep methods Predictor-corrector methods Construction of one-step methods Set up integral Z t n + 1 t n f ( , y ( )) d...
View Full Document

This note was uploaded on 02/23/2010 for the course MATH 2070 taught by Professor Aruliahdhavidhe during the Spring '10 term at UOIT.

Page1 / 4

28-Higher Order - Runge-Kutta methods Multistep methods Predictor-corrector methods Higher-Order Methods Dhavide Aruliah UOIT MATH 2070U c D

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online