 # ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 31 Ordinary Differential Equations.

## Presentation on theme: "ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 31 Ordinary Differential Equations."— Presentation transcript:

ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 31 Ordinary Differential Equations

Fig 23.1 FORWARD FINITE DIFFERENCE

Fig 23.2 BACKWARD FINITE DIFFERENCE

Fig 23.3 CENTERED FINITE DIFFERENCE

Data with Errors

Pendulum W=mg Ordinary Differential Equation

ODEs Non Linear Linearization Assume  is small

ODEs Second Order Systems of ODEs

Application of ODEs in Engineering Problem SOlving

ODE

ODE - OBJECTIVES Undetermined

ODE- Objectives Initial Conditions

ODE-Objectives Given Calculate

Runge-Kutta Methods New Value = Old Value + Slope X Step Size

Runge Kutta Methods Definition of  yields different Runge-Kutta Methods

Euler’s Method Let

Example

Euler h=0.5

Sources of Error Truncation: Caused by discretization Local Truncation Propagated Truncation Roundoff: Limited number of significant digits

Sources of Error Propagated Local

Euler’s Method

Heun’s Method PredictorCorrector 2-Steps

Heun’s Method Predict Predictor-Corrector Solution in 2 steps Let

Heun’s Method Correct Corrector Estimate Let

Error in Heun’s Method

The Mid-Point Method Remember: Definition of  yields different Runge-Kutta Methods

Mid-Point Method Predictor Corrector 2-Steps

Mid-Point Method Predictor Predict Let

Mid-Point Method Corrector Correct Estimate Let

Download ppt "ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 31 Ordinary Differential Equations."

Similar presentations