Introduction to Integration Methods. Types of Methods causal method employs values at prior computation instants. non-causal method if in addition to.

Slides:



Advertisements
Similar presentations
Formal Computational Skills
Advertisements

3- 1 Chapter 3 Introduction to Numerical Methods Second-order polynomial equation: analytical solution (closed-form solution): For many types of problems,
Integration Techniques
Asymptotic error expansion Example 1: Numerical differentiation –Truncation error via Taylor expansion.
ES 240: Scientific and Engineering Computation. InterpolationPolynomial  Definition –a function f(x) that can be written as a finite series of power functions.
ECIV 201 Computational Methods for Civil Engineers Richard P. Ray, Ph.D., P.E. Error Analysis.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Ordinary Differential Equations Equations which are.
Approximations and Errors
1 Part 3 Truncation Errors (Supplement). 2 Error Propagation How errors in numbers can propagate through mathematical functions? That is, what's the effect.
Lecture 2: Numerical Differentiation. Derivative as a gradient
Atms 4320 Lab 2 Anthony R. Lupo. Lab 2 -Methodologies for evaluating the total derviatives in the fundamental equations of hydrodynamics  Recall that.
Chapter 1 Introduction The solutions of engineering problems can be obtained using analytical methods or numerical methods. Analytical differentiation.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 32 Ordinary Differential Equations.
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 3 Approximations and Errors.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 31 Ordinary Differential Equations.
Initial-Value Problems
Dr. Jie Zou PHY Chapter 9 Ordinary Differential Equations: Initial-Value Problems Lecture (II) 1 1 Besides the main textbook, also see Ref.: “Applied.
ECIV 301 Programming & Graphics Numerical Methods for Engineers REVIEW III.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 181 Interpolation Chapter 18 Estimation of intermediate.
Second Term 05/061 Part 3 Truncation Errors (Supplement)
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 181 Interpolation.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Interpolation Chapter 18.
Numerical solution of Differential and Integral Equations PSCi702 October 19, 2005.
Quadrature Greg Beckham. Quadrature Numerical Integration Goal is to obtain the integral with as few computations of the integrand as possible.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 31.
Boyce/DiPrima 9th ed, Ch 8.4: Multistep Methods Elementary Differential Equations and Boundary Value Problems, 9th edition, by William E. Boyce and Richard.
Ch 8.3: The Runge-Kutta Method
Interpolation. Interpolation is important concept in numerical analysis. Quite often functions may not be available explicitly but only the values of.
EE3561_Unit 8Al-Dhaifallah14351 EE 3561 : Computational Methods Unit 8 Solution of Ordinary Differential Equations Lesson 3: Midpoint and Heun’s Predictor.
MATH 685/CSI 700 Lecture Notes Lecture 1. Intro to Scientific Computing.
1 EEE 431 Computational Methods in Electrodynamics Lecture 4 By Dr. Rasime Uyguroglu
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter.
MECN 3500 Inter - Bayamon Lecture 3 Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
Derivatives In modern structural analysis we calculate response using fairly complex equations. We often need to solve many thousands of simultaneous equations.
6. Introduction to Spectral method. Finite difference method – approximate a function locally using lower order interpolating polynomials. Spectral method.
Quadrature rules 1Michael Sokolov / Numerical Methods for Chemical Engineers / Numerical Quadrature Michael Sokolov ETH Zurich, Institut für Chemie- und.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 3.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 7 - Chapter 25.
Numerical Analysis CC413 Propagation of Errors.
Please remember: When you me, do it to Please type “numerical-15” at the beginning of the subject line Do not reply to my gmail,
Ch 8.2: Improvements on the Euler Method Consider the initial value problem y' = f (t, y), y(t 0 ) = y 0, with solution  (t). For many problems, Euler’s.
Today’s class Ordinary Differential Equations Runge-Kutta Methods
Lecture 40 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
ECE 576 – Power System Dynamics and Stability Prof. Tom Overbye Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Truncation Errors and the Taylor Series Chapter 4.
Ordinary Differential Equations
Sec 21: Generalizations of the Euler Method Consider a differential equation n = 10 estimate x = 0.5 n = 10 estimate x =50 Initial Value Problem Euler.
1/14  5.2 Euler’s Method Compute the approximations of y(t) at a set of ( usually equally-spaced ) mesh points a = t 0 < t 1
Lecture 39 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
This chapter is concerned with the problem in the form Chapter 6 focuses on how to find the numerical solutions of the given initial-value problems. Main.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 6 - Chapters 22 and 23.
Interpolation - Introduction
Part 7 - Chapter 25.
Interpolation Estimation of intermediate values between precise data points. The most common method is: Although there is one and only one nth-order.
Chapter 18.
Ordinary Differential Equations
ECE 576 – Power System Dynamics and Stability
Taylor series in numerical computations (review)
Interpolation.
Class Notes 18: Numerical Methods (1/2)
Chapter 18.
Class Notes 19: Numerical Methods (2/2)
Lecture 2 – Monte Carlo method in finance
Chapter 26.
Part 7 - Chapter 25.
SE301: Numerical Methods Topic 8 Ordinary Differential Equations (ODEs) Lecture KFUPM (Term 101) Section 04 Read , 26-2, 27-1 CISE301_Topic8L2.
5.3 Higher-Order Taylor Methods
Numerical Analysis Lecture 2.
Uncertainty Propagation
Presentation transcript:

Introduction to Integration Methods

Types of Methods causal method employs values at prior computation instants. non-causal method if in addition to prior values it also employs estimated values at time instants at and after the present time. order of a method = the number of pairs of derivative/state values it employs to compute the value of the state at any time. past 2 values are used to approximate derivative

Causal Methods A causal method of order m is often a linear combination of the state and derivative values at time instants ti-m to ti-1 with coefficients chosen to minimize the error from the computed estimate to the real value. Usually the basis of the derivation of the coefficients is the assumption that the state trajectories and the output trajectories are smooth enough to be approximated by the mth order polynomial. Often it is not known beforehand whether the requisite smoothness indeed obtains. startup is the determination of the state, derivative, and output values for the times t1-m to t1 at the initial simulation time t1. Use lower order causal or non-causal methods

Non-Causal Methods : E.g., Heun,A simple predictor-corrector method Use “future“ values The only way of obtaining them is: run the simulation out past the present model time, calculate and store the needed values, and use these data to estimate the present values. future value of input

Non-Causal: Runga-Kutta – 4 Th Order derivative estimates function evaluations future values of input At each step, the Runge-Kutta method of order four, uses four slopes, one calculated at the left-hand endpoint of the step, one calculated at the right-hand endpoint of the step and two calculated at the midpoint of the step. The two slopes calculated at the midpoint of each step are given twice as much weight as the slopes at the endpoints.

Error Sources and Effects Sources of error introduced at each step: – truncation error: the error introduced due to neglecting terms in the Taylor series higher than the m th order (assumes that the solution is analytic) –roundoff error: the error due to rounding off numbers due to the finite length of the computer word Effect of error: –depends on the model and the integration method, may propagate and accumulate –may accumulate without bound for an unstable method/model combination –may reach a bounded value for an stable method/model combination where the effect of introduced error gets damped out

Integration Method Speed-Accuracy Tradeoffs Eulerlownonenot for sufficiently small step sizes high Causal methods highyes low Non-Causal methods highno, if only future values used yeslow Integration Method EfficiencyStart-up ProblemsStability ProblemsRobustness