2. Numerical differentiation. Approximate a derivative of a given function. Approximate a derivative of a function defined by discrete data at the discrete.

Slides:



Advertisements
Similar presentations
Numerical Integration
Advertisements

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.
9.7 Taylor Series. Brook Taylor Taylor Series Brook Taylor was an accomplished musician and painter. He did research in a variety of areas,
CISE301_Topic61 SE301: Numerical Methods Topic 6 Numerical Differentiation Lecture 23 KFUPM Read Chapter 23, Sections 1-2.
Part 5 Chapter 19 Numerical Differentiation PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright © The McGraw-Hill.
NUMERICAL DIFFERENTIATION AND INTEGRATION
Numerical Computation
High Accuracy Differentiation Formulas
Chapter 7 Numerical Differentiation and Integration
Lecture 18 - Numerical Differentiation
CE33500 – Computational Methods in Civil Engineering Differentiation Provided by : Shahab Afshari
Chapter 18 Interpolation The Islamic University of Gaza
Numerical Analysis –Interpolation
Chapter 19 Numerical Differentiation §Estimate the derivatives (slope, curvature, etc.) of a function by using the function values at only a set of discrete.
Curve-Fitting Polynomial Interpolation
1 Chapter 3 INTERPOLATION. 2 WHAT IS INTERPOLATION? Given (x 0,y 0 ), (x 1,y 1 ), …, (x n,y n ), finding the value of ‘y’ at a value of ‘x’ in ( x 0,
1 Chapter 6 NUMERICAL DIFFERENTIATION. 2 When we have to differentiate a function given by a set of tabulated values or when a complicated function is.
Chapter 6 Numerical Interpolation
Numerical Differentiation:1* Lecture (II)
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. 1 Numerical Differentiation and Integration Part 6 Calculus.
Numerical Differentiation
3. Numerical integration (Numerical quadrature) .
Interpolation. Interpolation is important concept in numerical analysis. Quite often functions may not be available explicitly but only the values of.
Integration of 3-body encounter. Figure taken from
1. Interpolating polynomials Polynomial of degree n,, is a linear combination of Definitions: (interval, continuous function, abscissas, and polynomial)
9.7 and 9.10 Taylor Polynomials and Taylor Series.
Interpolation produces a function that matches the given data exactly. The function then can be utilized to approximate the data values at intermediate.
6. Introduction to Spectral method. Finite difference method – approximate a function locally using lower order interpolating polynomials. Spectral method.
Today’s class Numerical Differentiation Finite Difference Methods Numerical Methods Lecture 14 Prof. Jinbo Bi CSE, UConn 1.
Engineering Analysis – Computational Fluid Dynamics –
Chap. 11 Numerical Differentiation and Integration
CHAPTER 3 NUMERICAL METHODS
Lecture 22 Numerical Analysis. Chapter 5 Interpolation.
1 INTERPOLASI. Direct Method of Interpolation 3 What is Interpolation ? Given (x 0,y 0 ), (x 1,y 1 ), …… (x n,y n ), find the value of ‘y’ at a value.
The purpose of Chapter 5 is to develop the basic principles of numerical integration Usefule Words integrate, integral 积分(的), integration 积分(法), quadrature.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 5 Integration and Differentiation.
5. Interpolation 5.1 Definition of interpolation. 5.2 Formulas for Interpolation. 5.3 Formulas for Interpolation for unequal interval. 5.4 Applications.
Lecture 39 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
CSE 330 Numerical Methods Lecture 05 Chapter 5: Numerical Differentiation Md. Omar Faruqe
Quadrature – Concepts (numerical integration) Don Allen.
Interpolation - Introduction
1 Numerical Differentiation. 2  First order derivatives  High order derivatives  Examples.
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
Numerical Analysis Lecture 25.
Chapter 18.
Derivative of an Exponential
Advanced Numerical Methods (S. A. Sahu) Code: AMC 51151
Numerical Analysis Lecture 27.
Numerical Differentiation
Interpolation.
Chapter 18.
Chapter 23.
Numerical Analysis Lecture 45.
Calculus BC AP/Dual, Revised © : Lagrange's Error Bound
Numerical Analysis Lecture 23.
Numerical differentiation
POLYNOMIAL INTERPOLATION
Numerical Analysis Lecture 26.
MATH 2140 Numerical Methods
Numerical Analysis Lecture 19.
INTERPOLASI.
MATH 174: NUMERICAL ANALYSIS I
SKTN 2393 Numerical Methods for Nuclear Engineers
6 Numerical Differentiation
Numerical Analysis Lecture 21.
Lagrange Remainder.
Numerical Analysis Lecture 24.
Presentation transcript:

2. Numerical differentiation. Approximate a derivative of a given function. Approximate a derivative of a function defined by discrete data at the discrete points. Formulas for numerical differentiation can be derived from a derivative of the (Lagrange form of) interpolating polynomial.. Exc 2-0) Derive the form of finite difference formula for the first derivative, starting from a) Lagrange form, and b) Newton form.

ex) The second derivative f ’’(x) using 3 data points, x -1, x 0, x 1.. For x = x 0, and equally spaced x i, O(  x) error cancel out.

Exc 2-1) Derive the following finite difference formulas for the first derivative f ’ (x) with equally spaced abscissas. a) Second order backward, forward, and centered formula. b) Third order difference formula.. c) Fourth order centered difference formula.. Exc 2-2) Evaluate the error of finite difference formula for the second derivative f ’’ (x) which uses equally spaced 5 data points. Exc 2-3) Compute numerical derivative of e x using 2 nd and 4 th order centered formulas at x=1 with equally spaced abscissas. Decreasing the spacing  x, as 10 -n, check the fractional error converges as expected O(  x 2 ), and O(  x 4 ). (Make a plot.) What happens if n varies from 1 to 32 ?

Richardson extrapolation: A procedure to obtain higher order approximation Now, suppose f(x) is approximated by f  x at x = x 0, and its order is p-th order, we may write, with a constant K 1 Notation: (the same) order ; small (higher) order If we decresed the size of interval  x to  x / b, (b>1 const), we have Substituting K 1 from one to the other, we have higher order approximation (Commonly b = 2 is chosen. (recommended))

To apply Richardson extrapolation, the order of approximation formula should be known. If this order is know towards higher ones, one can repeatedly use the extrapolation to have higher order approximation. Exc 2-4) a) For the first order forward difference approximaion, apply Richardson extrapolation to O(  x 3 ). b) Write a code to apply this to calculate a derivative of f(x)=log x at x = 2. Choose a step size  x = 0.1, and make it 1/2 at each level of extrapolation.