Module 4
Module 4
For any given set of data points, there is only one polynomial (of least possible degree)
that passes through all of them
𝑓 𝑥2 −𝑓 𝑥1
𝑓1 𝑥 = 𝑓 𝑥1 + (𝑥 − 𝑥1 )
𝑥2 −𝑥1
which is the Newton linear-interpolating formula. The notation f1(x) denotes that this is a
first-order interpolating polynomial. The term
𝑓 𝑥2 − 𝑓 𝑥1 /(𝑥2 − 𝑥1 )
x3 f(x3)
Sample Problems on Newton's
Divided Difference Interpolation
1. Find f(x) as a polynomial in x for the following data by Newton’s divided
difference formula.
x -4 -1 0 2 5
f(x) 1245 33 5 9 1335
x -2 -1 0 1 3 4
f(x) 9 16 17 18 44 81
At x = 2;
f3(x)= b1 + b2(x – x1) + + b2(x – x1)(x – x2) + b3(x – x1)(x – x2) +
b4(x – x1)(x – x2)(x – x3)
Lagrange Interpolating Polynomial
The Lagrange interpolating polynomial is simply a reformulation of the Newton
interpolating polynomial. It can be represented concisely as
𝑓𝑛−1 𝑥 = σ𝑛𝑖=1 𝐿𝑖 𝑥 𝑓(𝑥𝑖 )
𝑥−𝑥𝑗
where: 𝐿𝑖 (𝑥) = ς𝑛𝑗=0 𝑥 −𝑥 where: designates the “product of.”
𝑖 𝑗
𝑗≠1
For a linear version (n = 1)
𝑥−𝑥1 𝑥−𝑥0
𝑓1 𝑥 = 𝑥0 −𝑥1
𝑓(𝑥0 ) + 𝑥1 −𝑥0
𝑓(𝑥1 )
𝑥−𝑥1 𝑥−𝑥0
= 𝐿0 and 𝑥 = 𝐿1
𝑥0 −𝑥1 1 −𝑥0
x -1 1 4 7
f(x) -2 0 63 342
Gregory−Newton Forward
Interpolation Method
This method uses the formula
Δ𝑓 Δ2 𝑓0
𝑓 𝑥 = 𝑓(𝑥0 ) + 𝑥 − 𝑥0 1!ℎ0 + 𝑥 − 𝑥0 𝑥 − 𝑥1 2!ℎ2
+⋯
𝑛
Δ 𝑓0
+(𝑥 − 𝑥0 )(𝑥 − 𝑥1 ) ⋯ (𝑥 − 𝑥𝑛 )
𝑛! ℎ𝑛
where:
Δ = is the forward difference operator
f0 = is the first value of the data set
Δf0 = is the first forward divided difference
Δ2f0 = is the second forward divided difference
Δ3f0 = is the third forward divided difference
Δnf0 = is the nth forward divided difference
Gregory−Newton Forward
Interpolation Method
The forward differences can be written in a tabular form as
xi f(xi) Δf Δ 2f Δ 3f
x2 f(x2) Δf2 = f3 – f2
x3 f(x3)
Sample Problem in Gregory−Newton
Forward Interpolation Method
where:
𝛻 = is the backward difference operator
f(xn) = is the last value of the data set
𝛻f(xn) = is the first backward divided difference
𝛻2f(xn) = is the second backward divided difference
𝛻3f(xn) = is the third backward divided difference
𝛻nf(xn) = is the nth backward divided difference
Gregory−Newton Backward
Interpolation Method
The backward differences can be written in a tabular form as
xi f(xi) 𝛻f 𝛻 2f 𝛻 3f
x0 f(x0)
x1 f(x1) 𝛻f1 = f1 – f0