0% found this document useful (0 votes)
30 views11 pages

Interpolation: X A X A X A A X F

Interpolation is a method of estimating values within a range of known data points using polynomials. There are various forms of interpolation polynomials including linear, quadratic, and Newton's general form which uses divided differences. The structure of Newton's interpolating polynomials is similar to Taylor series expansions in that higher order derivatives are added sequentially. The error of an nth-order interpolation polynomial depends on the (n+1)th derivative of the function and can alternatively be estimated using additional data points if the function is non-differentiable.

Uploaded by

Kukuh Kurniadi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
30 views11 pages

Interpolation: X A X A X A A X F

Interpolation is a method of estimating values within a range of known data points using polynomials. There are various forms of interpolation polynomials including linear, quadratic, and Newton's general form which uses divided differences. The structure of Newton's interpolating polynomials is similar to Taylor series expansions in that higher order derivatives are added sequentially. The error of an nth-order interpolation polynomial depends on the (n+1)th derivative of the function and can alternatively be estimated using additional data points if the function is non-differentiable.

Uploaded by

Kukuh Kurniadi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

Interpolation

• Estimation of intermediate values between precise


data points. The most common method is:
f ( x)  a0  a1 x  a2 x 2    an x n

• 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:
– The Newton polynomial

1
2
Newton’s Divided-Difference
Interpolating Polynomials
Linear Interpolation/
• Is the simplest form of interpolation, connecting two data
points with a straight line.
Slope and a
finite divided
f1 ( x)  f ( x0 ) f ( x1 )  f ( x0 )
 difference
x  x0 x  x0 approximation to
1st derivative
f ( x1 )  f ( x0 )
f1 ( x)  f ( x0 )  ( x  x0 ) Linear-interpolation
x  x0 formula

• f1(x) designates that this is a first-order interpolating


polynomial.
3
4
5
Quadratic Interpolation/
• If three data points are available, the estimate is
improved by introducing some curvature into the line
connecting the points.
f 2 ( x)  b0  b1 ( x  x0 )  b2 ( x  x0 )( x  x1 )
• A simple procedure can be used to determine the
values of the coefficients.
x  x0 b0  f ( x0 )
f ( x1 )  f ( x0 )
x  x1 b1 
x  x0
f ( x2 )  f ( x1 ) f ( x1 )  f ( x0 )

x2  x1 x1  x0
x  x2 b2 
x2  x0
6
x  x0 b0  f ( x0 )
f ( x1 )  f ( x0 )
x  x1 b1 
x  x0
f ( x2 )  f ( x1 ) f ( x1 )  f ( x0 )

x2  x1 x1  x0
x  x2 b2 
x2  x0

7
General Form of Newton’s Interpolating Polynomials/
f n ( x)  f ( x0 )  ( x  x0 ) f [ x1 , x0 ]  ( x  x0 )( x  x1 ) f [ x2 , x1 , x0 ]
   ( x  x0 )( x  x1 )  ( x  xn 1 ) f [ xn , xn 1 , , x0 ]
b0  f ( x0 )
x  x0 b0  f ( x0 )
b1  f [ x1 , x0 ]
f ( x1 )  f ( x0 )
b2  f [ x2 , x1 , x0 ] x  x1 b1 
x  x0
 f ( x2 )  f ( x1 ) f ( x1 )  f ( x0 )

bn  f [ xn , xn 1 , , x1 , x0 ] x2  x1 x1  x0
x  x2 b2 
x2  x0
f ( xi )  f ( x j )
f [ xi , x j ]  Bracketed function
xi  x j evaluations are finite
f [ xi , x j ]  f [ x j , xk ] divided differences
f [ xi , x j , xk ] 
xi  xk

f [ xn , xn 1 , , x1 ]  f [ xn 1 , xn  2 , , x0 ]
f [ xn , xn 1 , , x1 , x0 ] 
xn  x0 8
9
Errors of Newton’s Interpolating Polynomials/
• Structure of interpolating polynomials is similar to the Taylor
series expansion in the sense that finite divided differences are
added sequentially to capture the higher order derivatives.
• For an nth-order interpolating polynomial, an analogous
relationship for the error is:
f ( n1) ( )  Is somewhere
Rn  ( x  x0 )( x  x1 ) ( x  xn ) containing the unknown
(n  1)! and he data

• For non differentiable functions, if an additional point f(xn+1)


is available, an alternative formula can be used that does not
require prior knowledge of the function:

Rn  f [ xn1 , xn , xn1 ,, x0 ]( x  x0 )( x  x1 )( x  xn )


10
11

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy