POLYNOMIAL INTERPOLATION

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.
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
KFUPM SE301: Numerical Methods Topic 5: Interpolation Lectures 20-22:
DERIVATIVES Linear Approximations and Differentials In this section, we will learn about: Linear approximations and differentials and their applications.
Curve-Fitting Interpolation
14 Aug 2007 KKKQ 3013 PENGIRAAN BERANGKA Week 6 – Interpolation & Curve Fitting 14 August am – 9.00 am.
Curve-Fitting Polynomial Interpolation
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 22 CURVE FITTING Chapter 18 Function Interpolation and Approximation.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 181 Interpolation Chapter 18 Estimation of intermediate.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 23 CURVE FITTING Chapter 18 Function Interpolation and Approximation.
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.
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.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 21 CURVE FITTING Chapter 18 Function Interpolation and Approximation.
DERIVATIVES 3. We have seen that a curve lies very close to its tangent line near the point of tangency. DERIVATIVES.
19.5 Numeric Integration and Differentiation
Numerical Differential & Integration. Introduction If a function f(x) is defined as an expression, its derivative or integral is determined using analytical.
Interpolation. Interpolation is important concept in numerical analysis. Quite often functions may not be available explicitly but only the values of.
1 Trapezoidal Rule of Integration. What is Integration Integration: The process of measuring the area under a function.
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.
Numerical Methods For Slides Thanks to Lecture 6 Interpolation
Interpolation produces a function that matches the given data exactly. The function then can be utilized to approximate the data values at intermediate.
Chap. 11 Numerical Differentiation and Integration
CHAPTER 3 NUMERICAL METHODS
Lecture 22 Numerical Analysis. Chapter 5 Interpolation.
KFUPM SE301: Numerical Methods Topic 5: Interpolation Lectures 20-22:
EE3561_Unit 5(c)AL-DHAIFALLAH14361 EE 3561 : Computational Methods Unit 5 : Interpolation Dr. Mujahed AlDhaifallah (Term 351) Read Chapter 18, Sections.
MECN 3500 Inter - Bayamon Lecture 6 Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
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.
Principles of Extrapolation
CSE 330 Numerical Methods Lecture 05 Chapter 5: Numerical Differentiation Md. Omar Faruqe
Interpolation - Introduction
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 21 Numerical Differentiation.
1 Approximating functions, polynomial interpolation (Lagrange and Newton’s divided differences) formulas, error approximations.
11/22/ Differentiation-Discrete Functions.
Numerical Integration
CHAPTER 3 NUMERICAL METHODS
Air Force Admin College, Coimbatore
NUMERICAL DIFFERENTIATION Forward Difference Formula
High Accuracy Differentiation Formulas
1. 2 What is Integration? Integration The process of measuring the area under a curve. Where: f(x) is the integrand a= lower limit of integration b=
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.
Numerical Integration Formulas
Chapter 22.
INTERPOLATION Interpolation produces a function that matches the given data exactly. The function then can be utilized to approximate the data values.
Interpolation.
Chapter 18.
Chapter 23.
Solution of Equations by Iteration
MATH 2140 Numerical Methods
Lagrangian Interpolation
Newton’s Divided Difference Polynomial Method of Interpolation
Numerical Analysis Lecture 23.
Numerical Analysis Lecture 26.
Numerical Computation and Optimization
INTERPOLASI.
5.3 Higher-Order Taylor Methods
Lagrangian Interpolation
6 Numerical Differentiation
Numerical Computation and Optimization
Numerical Analysis Lecture 21.
Copyright © Cengage Learning. All rights reserved.
Interpolation with unequal intervals
Air Force Admin College, Coimbatore
Presentation transcript:

POLYNOMIAL INTERPOLATION course-6 / numerical method POLYNOMIAL INTERPOLATION Fitting polynomial to given data points Most of numerical method schemes are based on polynomial interpolation, e.g. numerical integration and differentiation.

course-6 / numerical method LINEAR INTERPOLATION The linear interpolation shown in figure previous is given by The maximum error of the linear interpolation is expressed in the form

Can three or more data points be fitted by a curve ?

LAGRANGE INTERPOLATION Suppose N+1 data points are given. The Lagrange interpolation formula of order N-th is written as follows

The maximum error of Lagrange interpolation is expressed in the form There is no guarantee that the interpolation polynomial converges to the exact function when the number of data point is increased. In general, interpolation with a large-order polynomial should be avoided or used with extreme cautions

NEWTON INTERPOLATION The drawback of the Lagrange interpolation: The amount of computation needed for one interpolation is large No part of the previous application can be used to interpolate another value of x When the number of data points has to be increased or decreased, the results of the previous computations cannot be used Evaluation of error is not easy

DIVIDED DIFFERENCE To evaluate a Newton interpolation formula, a forward difference table is necessary

Therefore, the forward difference table is given by (for third order) 1 2 3

Hence, the Newton interpolation formula is written as follows where are obtained from forward difference table The maximum error of Newton interpolation is in the form

Application Consider the data points given in the following table i 1 1 2 3 4 5 0.1 0.2 0.3 0.5 0.7 0.9 0.9975 0.9776 0.9384 0.8812 0.8075 0.7196

Derive the Lagrange and Newton forward interpolation fitted to the data points at a. i = 0, 1, 2 (evaluate for x = 0.21) b. i = 1, 2, 3 (evaluate for x = 0.21) c. i = 1, 2, 3, 4 (evaluate for x = 0.21) Estimate the maximum error for every evaluate of x