Interpolasi Pertemuan - 7 Mata Kuliah : Analisis Numerik

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

Computers in Civil Engineering 53:081 Spring 2003 Lecture #14 Interpolation.
2. Numerical differentiation. Approximate a derivative of a given function. Approximate a derivative of a function defined by discrete data at the discrete.
Chapter 18 Interpolation The Islamic University of Gaza
KFUPM SE301: Numerical Methods Topic 5: Interpolation Lectures 20-22:
Curve-Fitting Interpolation
14 Aug 2007 KKKQ 3013 PENGIRAAN BERANGKA Week 6 – Interpolation & Curve Fitting 14 August am – 9.00 am.
CURVE FITTING ENGR 351 Numerical Methods for Engineers
Curve-Fitting Polynomial Interpolation
Interpolation Used to estimate values between data points difference from regression - goes through data points no error in data points.
Polynomial Interpolation
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Martin Mendez UASLP Chapter 61 Unit II.
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.
ECIV 301 Programming & Graphics Numerical Methods for Engineers REVIEW II.
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.
Dr. Marco A. Arocha Aug,  “Roots” problems occur when some function f can be written in terms of one or more dependent variables x, where the.
Chapter 6 Numerical Interpolation
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 21 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 171 Least.
CpE- 310B Engineering Computation and Simulation Dr. Manal Al-Bzoor
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Applied Numerical Methods With MATLAB ® for Engineers.
Curve Fitting and Regression EEE 244. Descriptive Statistics in MATLAB MATLAB has several built-in commands to compute and display descriptive statistics.
Part 4 Chapter 17 Polynomial Interpolation PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright © The McGraw-Hill.
Polynomial Interpolation You will frequently have occasions to estimate intermediate values between precise data points. The function you use to interpolate.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
Chapter 8 Curve Fitting.
Chapter 14 Curve Fitting : Polynomial Interpolation Gab Byung Chae.
Curve-Fitting Regression
Introduction to Numerical Analysis I MATH/CMPSC 455 Interpolation.
Interpolation produces a function that matches the given data exactly. The function then can be utilized to approximate the data values at intermediate.
Numerical Methods for Engineering MECN 3500
Chap. 11 Numerical Differentiation and Integration
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
Chapter 13 Objectives Familiarizing yourself with some basic descriptive statistics and the normal distribution. Knowing how to compute the slope and intercept.
Maclaurin and Taylor Polynomials Objective: Improve on the local linear approximation for higher order polynomials.
Interpolation - Introduction
1 Approximating functions, polynomial interpolation (Lagrange and Newton’s divided differences) formulas, error approximations.
CHAPTER 3 NUMERICAL METHODS
Polynomial Interpolation
Numerical Analysis Lecture 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.
Pengenalan Awal Metode Numerik
Interpolation.
Chapter 18.
INTERPOLATION Prof. Samuel Okolie, Prof. Yinka Adekunle & Dr
NUMERICAL DIFFERENTIATION AND INTEGRATION
Chapter 23.
Today’s class Multiple Variable Linear Regression
MATH 2140 Numerical Methods
Metode Eliminasi Pertemuan – 4, 5, 6 Mata Kuliah : Analisis Numerik
Numerical Analysis Lecture 23.
POLYNOMIAL INTERPOLATION
Numerical Analysis Lecture 26.
Numerical Computation and Optimization
INTERPOLASI.
SKTN 2393 Numerical Methods for Nuclear Engineers
Numerical Analysis Lecture 21.
Roots of Polynomials Chapter 7 The Islamic University of Gaza
Numerical Analysis Lecture 24.
Interpolation with unequal intervals
Theory of Approximation: Interpolation
Presentation transcript:

Interpolasi Pertemuan - 7 Mata Kuliah : Analisis Numerik Kode : CIV - 208 SKS : 3 SKS Interpolasi Pertemuan - 7

Sub Pokok Bahasan : Interpolasi Newton Interpolasi Lagrange

You will frequently have occasion to estimate intermediate values between precise data points. The most common method used for this purpose is polynomial interpolation. Recall that the general formula for an nth-order polynomial is f(x)=a0+a1x+a2x2+···+anxn For n+1 data points, there is one and only one polynomial of order n that passes through all the points. For example, there is only one straight line (that is, a first-order polynomial) that connects two points (Fig. a). Similarly, only one parabola connects a set of three points (Fig. b).

Polynomial interpolation consists of determining the unique nth-order polynomial that fits n+1 data points. This polynomial then provides a formula to compute intermediate values. Although there is one and only one nth-order polynomial that fits n+1 points, there are a variety of mathematical formats in which this polynomial can be expressed. Two alternatives that are well-suited for computer implementation are the Newton and the Lagrange polynomials.

Newton Linear Interpolation The simplest form of interpolation is to connect two data points with a straight line. This technique, called linear interpolation, is depicted graphically in Fig. Using similar triangles : which is a linear-interpolation formula. The notation f1(x) designates that this is a first order interpolating polynomial

Example 1 : Estimate the natural logarithm of 2 using linear interpolation. First, perform the computation by interpolating between ln 1=0 and ln6=1.791759. Then, repeat the procedure, but use a smaller interval from ln 1 to ln 4 (1.386294). Note that the true value of ln 2 is 0.6931472.

Newton Quadratic Interpolation If three data points are available, this can be accomplished with a second-order polynomial (also called a quadratic polynomial or a parabola). A particularly convenient form for this purpose is f2(x)=b0+b1(x−x0)+b2(x−x0)(x−x1)

A simple procedure can be used to determine the values of the coefficients. For x = x0 b0=f(x0) For x = x1 For x = x2

Example 2 : Fit a second-order polynomial to the three points used in Example 1: x0=1 f(x0)=0 x1=4 f(x1)=1.386294 x2=6 f(x2)=1.791759 Use the polynomial to evaluate ln 2.

General Form of Newton’s Interpolating Polynomials The preceding analysis can be generalized to fit an nth-order polynomial to n+1 data points. The nth-order polynomial is fn(x)=b0+b1(x−x0)+···+bn(x−x0)(x−x1)···(x−xn−1) (1) We use these data points and the following equations to evaluate the coefficients:

bo = f(xo) (2) b1 = f[x1.xo] (3) b2 = f[x2, x1, xo] (4) ….... bn = f[xn, xn1, ……, x1, xo] (5) where the bracketed function evaluations are finite divided differences.

For example, the first finite divided difference is represented generally as The second finite divided difference, which represents the difference of two first divided differences, is expressed generally as

Similarly, the nth finite divided difference is These differences can be used to evaluate the coefficients in Eqs. (2) through (5), which can then be substituted into Eq. (1) to yield the interpolating polynomial

Example 3 In Example 2, data points at x0=1, x1=4, and x2=6 were used to estimate ln 2 with a parabola. Now, adding a fourth point [x3=5; f(x3)= 1.609438], estimate ln 2 with a third-order Newton’s interpolating polynomial.

Lagrange Interpolating Polynomials The Lagrange interpolating polynomial is simply a reformulation of the Newton polynomial that avoids the computation of divided differences. It can be represented concisely as (6)

Where where P designates the “product of.” For example, the linear version (n=1) is

and the second-order version is the summation of all the products designated by Eq. (6) is the unique nth order polynomial that passes exactly through all n+1 data points.

Example 4 Use a Lagrange interpolating polynomial of the first and second order to evaluate ln 2 on the basis of the data given in Example 2: x0=1 f(x0)=0 x1=4 f(x1)=1.386294 x2=6 f(x2)=1.791760

Homework