Lecture 22 Numerical Analysis. Chapter 5 Interpolation.

Slides:



Advertisements
Similar presentations
Numerical Integration
Advertisements

Week 10 Generalised functions, or distributions
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.
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
Numerical Methods.  Polynomial interpolation involves finding a polynomial of order n that passes through the n+1 points.  Several methods to obtain.
Chapter 7 Numerical Differentiation and Integration
2. Numerical differentiation. Approximate a derivative of a given function. Approximate a derivative of a function defined by discrete data at the discrete.
CE33500 – Computational Methods in Civil Engineering Differentiation Provided by : Shahab Afshari
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
Computational Methods in Physics PHYS 3437
Ch 5.2: Series Solutions Near an Ordinary Point, Part I
Ch 5.6: Series Solutions Near a Regular Singular Point, Part I
Ch 5.1: Review of Power Series
Curve-Fitting Polynomial Interpolation
Ch 5.5: Series Solutions Near a Regular Singular Point, Part I We now consider solving the general second order linear equation in the neighborhood of.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 181 Interpolation Chapter 18 Estimation of intermediate.
19. Series Representation of Stochastic Processes
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Interpolation Chapter 18.
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.
ON MULTIVARIATE POLYNOMIAL INTERPOLATION
Chapter 6 Numerical Interpolation
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 171 Least.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Numerical Differentiation and Integration Part 6 Calculus.
CSE 330 : Numerical Methods
Interpolation. Interpolation is important concept in numerical analysis. Quite often functions may not be available explicitly but only the values of.
Simpson Rule For Integration.
1 5. Functions of a Random Variable Let X be a r.v defined on the model and suppose g(x) is a function of the variable x. Define Is Y necessarily a r.v?
WEEK 8 SYSTEMS OF EQUATIONS DETERMINANTS AND CRAMER’S RULE.
Meeting 11 Integral - 3.
Numerical Methods Part: Simpson Rule For Integration.
1 Interpolation. 2 What is Interpolation ? Given (x 0,y 0 ), (x 1,y 1 ), …… (x n,y n ), find the value of ‘y’ at a.
Lecture 8 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Partial-fraction Expansion
1 Inverse Laplace Transform Note that most of the transforms are written as fractions.
Integrals  In Chapter 2, we used the tangent and velocity problems to introduce the derivative—the central idea in differential calculus.  In much the.
Interpolation produces a function that matches the given data exactly. The function then can be utilized to approximate the data values at intermediate.
1 Two Functions of Two Random Variables In the spirit of the previous lecture, let us look at an immediate generalization: Suppose X and Y are two random.
In section 11.9, we were able to find power series representations for a certain restricted class of functions. Here, we investigate more general problems.
CHAPTER 3 NUMERICAL METHODS
Jump to first page Chapter 3 Splines Definition (3.1) : Given a function f defined on [a, b] and a set of numbers, a = x 0 < x 1 < x 2 < ……. < x n = b,
In Chapters 6 and 8, we will see how to use the integral to solve problems concerning:  Volumes  Lengths of curves  Population predictions  Cardiac.
Lecture 40 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.
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.
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
NUMERICAL DIFFERENTIATION or DIFFERENCE APPROXIMATION Used to evaluate derivatives of a function using the functional values at grid points. They are.
CSE 330 Numerical Methods Lecture 05 Chapter 5: Numerical Differentiation Md. Omar Faruqe
Numerical Analysis Lecture 28. Chapter 7 Numerical Differentiation and Integration.
5 Solving Polynomial Equations.
Chapter 7 Numerical Differentiation and Integration
Numerical Analysis Lecture 25.
Interpolation.
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.
Advanced Numerical Methods (S. A. Sahu) Code: AMC 51151
Numerical Analysis Lecture 27.
Chapter 18.
Chapter 23.
Numerical Analysis Lecture 45.
Chapter 7 Numerical Differentiation and Integration
Numerical Analysis Lecture 23.
POLYNOMIAL INTERPOLATION
Numerical Analysis Lecture 26.
MATH 174: Numerical Analysis
Numerical Analysis Lecture 19.
Numerical Analysis Lecture 21.
  NUMERICAL METHODS.
Numerical Analysis Lecture 24.
Presentation transcript:

Lecture 22 Numerical Analysis

Chapter 5 Interpolation

Finite Difference Operators Newton’s Forward Difference Interpolation Formula Newton’s Backward Difference Interpolation Formula Lagrange’s Interpolation Formula Divided Differences Interpolation in Two Dimensions Cubic Spline Interpolation

Thus Similarly

Shift operator, E

The inverse operator E -1 is defined as Similarly,

Average Operator,

Differential Operator, D

Important Results

Newton’s Forward Difference Interpolation Formula

Let y = f (x) be a function which takes values f (x 0 ), f (x 0 + h), f (x 0 +2h), …, corresponding to various equi- spaced values of x with spacing h, say x 0, x 0 + h, x 0 + 2h, …. Suppose, we wish to evaluate the function f (x) for a value x 0 + ph, where p is any real number, then for any real number p, we have the operator E such that

This is known as Newton’s forward difference formula for interpolation, which gives the value of f (x 0 + ph) in terms of f (x 0 ) and its leading differences.

This formula is also known as Newton-Gregory forward difference interpolation formula. Here p=(x-x 0 )/h. An alternate expression is

Exercise Find a cubic polynomial in x which takes on the values -3, 3, 11, 27, 57 and 107, when x = 0, 1, 2, 3, 4 and 5 respectively.

Solution Here, the observations are given at equal intervals of unit width. To determine the required polynomial, we first construct the difference table

Difference Table

Since the 4 th and higher order differences are zero, the required Newton’s interpolation formula

Here,

Substituting these values into the formula, we have The required cubic polynomial.

NEWTON’S BACKWARD DIFFERENCE INTERPOLATION FORMULA

For interpolating the value of the function y = f (x) near the end of table of values, and to extrapolate value of the function a short distance forward from y n, Newton’s backward interpolation formula is used

Derivation Let y = f (x) be a function which takes on values f (x n ), f (x n -h), f (x n -2h), …, f (x 0 ) corresponding to equispaced values x n, x n -h, x n -2h, …, x 0. Suppose, we wish to evaluate the function f (x) at (x n + ph),

where p is any real number, then we have the shift operator E, such that Binomial expansion yields,

That is,

This formula is known as Newton’s backward interpolation formula. This formula is also known as Newton’s-Gregory backward difference interpolation formula.

If we retain (r + 1)terms, we obtain a polynomial of degree r agreeing with f (x) at x n, x n-1, …, x n-r. Alternatively, this formula can also be written as Here

Example For the following table of values, estimate f (7.5).

Solution The value to be interpolated is at the end of the table. Hence, it is appropriate to use Newton’s backward interpolation formula. Let us first construct the backward difference table for the given data

Difference Table

Since the 4 th and higher order differences are zero, the required Newton’s backward interpolation formula is

In this problem,

Example The sales for the last five years is given in the table below. Estimate the sales for the year 1979

Solution Newton’s backward difference table for the given data as -3

In this example, and

Newton’s interpolation formula gives Therefore,

LAGRANGE’S INTERPOLATION FORMULA

Newton’s interpolation formulae developed earlier can be used only when the values of the independent variable x are equally spaced. Also the differences of y must ultimately become small.

If the values of the independent variable are not given at equidistant intervals, then we have the basic formula associated with the name of Lagrange which will be derived now.

Lecture 22 Numerical Analysis

Let y = f (x) be a function which takes the values, y 0, y 1,…y n corresponding to x 0, x 1, …x n. Since there are (n + 1) values of y corresponding to (n + 1) values of x, we can represent the function f (x) by a polynomial of degree n.

Suppose we write this polynomial in the form. or in the form

Here, the coefficients a k are so chosen as to satisfy this equation by the (n + 1) pairs (x i, y i ). Thus we get Therefore,

Similarly, we obtain and

Substituting the values of a 0, a 1, …, a n we get The Lagrange’s formula for interpolation

This formula can be used whetherthe values x 0, x 2, …, x n are equally spaced or not. Alternatively, this can also be written in compact form as This formula can be used whether the values x 0, x 2, …, x n are equally spaced or not. Alternatively, this can also be written in compact form as

Where, We can easily observe that, and Thus introducing Kronecker delta notation

Further, if we introduce the notation That is is a product of (n + 1) factors. Clearly, its derivative contains a sum of (n + 1) terms in each of which one of the factors of will be absent.

We also define, which is same as except that the factor (x–x k ) is absent. Then But, when x = x k, all terms in the above sum vanishes except P k (x k )

Hence,

Finally, the Lagrange’s interpolation polynomial of degree n can be written as

Example Find Lagrange’s interpolation polynomial fitting the points y(1) = -3, y(3) = 0, y(4) = 30, y(6) = 132. Hence find y(5).

Solution The given data can be arranged as

Using Lagrange’s interpolation formula, we have

On simplification, we get which is required Lagrange’s interpolation polynomial. Now, y(5) = 75.

Example Given the following data, evaluate f (3) using Lagrange’s interpolating polynomial.

Solution Using Lagrange’s formula,

Therefore