1 Numerical Differentiation Jyun-Ming Chen. 2 Contents Forward, Backward, Central Difference Richardson Extrapolation.

Slides:



Advertisements
Similar presentations
Interpolation A standard idea in interpolation now is to find a polynomial pn(x) of degree n (or less) that assumes the given values; thus (1) We call.
Advertisements

Numerical Methods Lecture 14 Differentiation-Continuous Functions
Ordinary Differential Equations
CSE Differentiation Roger Crawfis. May 19, 2015OSU/CIS 5412 Numerical Differentiation The mathematical definition: Can also be thought of as the.
Romberg Rule of Integration
CISE301_Topic61 SE301: Numerical Methods Topic 6 Numerical Differentiation Lecture 23 KFUPM Read Chapter 23, Sections 1-2.
Numerical Integration of Functions
EE3561_Unit 6(c)AL-DHAIFALLAH14351 EE 3561 : Computational Methods Unit 6 Numerical Differentiation Dr. Mujahed AlDhaifallah ( Term 342)
Numerical Computation
High Accuracy Differentiation Formulas
2. Numerical differentiation. Approximate a derivative of a given function. Approximate a derivative of a function defined by discrete data at the discrete.
Lecture 18 - Numerical Differentiation
CE33500 – Computational Methods in Civil Engineering Differentiation Provided by : Shahab Afshari
Error Measurement and Iterative Methods
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 5 Numerical Integration Spring 2010 Prof. Chung-Kuan Cheng 1.
SE301_14(c)AL-AMER20031 SE031Numerical Methods Topic 6 Numerical Differentiation Dr. Samir Al-Amer ( Term 053) Modified by Dr. Baroudi(072) Read chapter.
1 Part 3 Truncation Errors (Supplement). 2 Error Propagation How errors in numbers can propagate through mathematical functions? That is, what's the effect.
DERIVATIVES Linear Approximations and Differentials In this section, we will learn about: Linear approximations and differentials and their applications.
Lecture 2: Numerical Differentiation. Derivative as a gradient
Chapter 19 Numerical Differentiation §Estimate the derivatives (slope, curvature, etc.) of a function by using the function values at only a set of discrete.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 5 Approximations, Errors and The Taylor Series.
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 23 Numerical Differentiation.
NUMERICAL DIFFERENTIATION The derivative of f (x) at x 0 is: An approximation to this is: for small values of h. Forward Difference Formula.
8/15/ Differentiation-Continuous Functions Major: All Engineering Majors Authors: Autar Kaw, Sri Harsha Garapati.
Numerical Differentiation
Ch 8.1 Numerical Methods: The Euler or Tangent Line Method
Boyce/DiPrima 9th ed, Ch 8.4: Multistep Methods Elementary Differential Equations and Boundary Value Problems, 9th edition, by William E. Boyce and Richard.
Chapter 4 Numerical Differentiation and Integration 1/16 Given x 0, approximate f ’(x 0 ). h xfhxf xf h )()( lim)('    x0x0 x1x1 h x1x1 x0x0.
Ch 8.3: The Runge-Kutta Method
Chapter 1 Scientific Computing Approximation in Scientific Computing (1.2) January 12, 2010.
Numerical Methods on Partial Differential Equation Md. Mashiur Rahman Department of Physics University of Chittagong Laplace Equation.
ES 240: Scientific and Engineering Computation. Chapter 4 Chapter 4: Errors Uchechukwu Ofoegbu Temple University.
1 EEE 431 Computational Methods in Electrodynamics Lecture 4 By Dr. Rasime Uyguroglu
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Numerical Differentiation and Integration ~ Integration.
10/27/ Differentiation-Continuous Functions Computer Engineering Majors Authors: Autar Kaw, Sri Harsha Garapati.
Computational Methods in Physics PHYS 3437 Dr Rob Thacker Dept of Astronomy & Physics (MM-301C)
CSE Differentiation Roger Crawfis Prepaid by:
Today’s class Numerical Differentiation Finite Difference Methods Numerical Methods Lecture 14 Prof. Jinbo Bi CSE, UConn 1.
Sensitivity derivatives Can obtain sensitivity derivatives of structural response at several levels Finite difference sensitivity (section 7.1) Analytical.
Engineering Analysis – Computational Fluid Dynamics –
Chap. 11 Numerical Differentiation and Integration
Lecture 39 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
NUMERICAL DIFFERENTIATION or DIFFERENCE APPROXIMATION Used to evaluate derivatives of a function using the functional values at grid points. They are.
The Finite-Difference Method Taylor Series Expansion Suppose we have a continuous function f(x), its value in the vicinity of can be approximately expressed.
1 Numerical Differentiation. 2  First order derivatives  High order derivatives  Examples.
Differentiation – Continuous Functions. Forward Difference Approximation 2 f  x  Δx   f  x  Δx lim Δx  0 f  x   For a finite 'Δx' (we can not.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 21 Numerical Differentiation.
NUMERICAL DIFFERENTIATION Forward Difference Formula
High Accuracy Differentiation Formulas
Finite Difference Methods
Differentiation-Continuous Functions
Chapter 22.
Taylor series in numerical computations (review)
Taylor series in numerical computations (review, cont.)
Numerical Analysis Lecture 27.
CSE245: Computer-Aided Circuit Simulation and Verification
Sec:4.1 THE TAYLOR SERIES.
CSE Differentiation Roger Crawfis.
Chapter 23.
CSE Differentiation Roger Crawfis.
Sec 21: Analysis of the Euler Method
Numerical Differentiation Chapter 23
CSE245: Computer-Aided Circuit Simulation and Verification
MATH 174: NUMERICAL ANALYSIS I
Romberg Rule of Integration
Romberg Rule of Integration
Romberg Rule of Integration
Numerical Computation and Optimization
Romberg Rule of Integration
Presentation transcript:

1 Numerical Differentiation Jyun-Ming Chen

2 Contents Forward, Backward, Central Difference Richardson Extrapolation

3 Taylor’s Expansion

4 Forward Difference Formula for Geometrically h

5 Backward Difference Formula for Similarly h Geometrically

6 Central Difference Formula for –)–)

7 2h Geometrically

8 Example, Calculate f’(1) using FD, BD, CD

9 Example (cont) h=0.1 h=0.05 FD: BD: CD:

10 Example (cont) Remarks: –FD, BD, CD each involves 2 function calls, 1 subtraction, and 1 division: same computation time –CD is the most accurate (hence, the most recommended method) –However, sometimes, CD cannot be applied

11 Forward Difference Formula for –2  )

12 Backward Difference Formula for –2  )

13 Central Difference Formula for +)+) Similar remark on the selection of FD|BD|CD applies for f”(x)

14 More Accurate FD Formula for

15 Better accuracy can be achieved using this formula But, it involves more computations: –3 function calls, two +/–, one division Trade-off: –More computation is the price you paid for better accuracy Similar idea applies to more accurate BD formula More Accurate FD Formula (cont)

16 Richardson Extrapolation Idea: exact = computed+ error The truncation error is of the form: ch k –where c is some constant Use different h to estimate the truncation error Use extrapolation to get more accurate result

17 Example: CD for f’(x) Using Different h (h 1, h 2 ) : c 1 and c 2 could be different Richardson Extrapolation (cont)

18 If Richardson Extrapolation (cont)

19 f(x) = x 3. Use CD with Richardson extrapolation to compute f’(1) Example Magic? Coincidence?

20 Revisit CD Formula for –)–) Change notation:

21 Error Analysis Assuming Eliminate a 1 to get better accuracy

22 Error Analysis (cont) 44 –) O(h4)O(h4)

23 Revisit Previous Example f(x) = x 3. Use CD with Richardson extrapolation to compute f’(1) a 2 involves f (5) (x), hence, the exact solution is no surprise.

24 Remark How much effort did we use to get this level of accuracy? –F(h): f(x+h), f(x-h); one –, one  –F(h/2): f(x+h/2), f(x-h/2); one –, one  –R.E.: two , one –

25 Summary (Textbook p.373)

26

27 אקסטרפולציית ריצ'רדסון לביטול איבר השגיאה המוביל