SlideShare a Scribd company logo
Adv. Engg. Mathematics
MTH-812 Divided Differences Interpolations
Dr. Yasir Ali (yali@ceme.nust.edu.pk)
DBS&H, CEME-NUST
December 4, 2017
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Interpolation Problem
Given 1 The (n + 1) nodes: x0, x1, ..., xn
2 The functional values f0, f1, ..., fn at these nodes
3 An Intermediate (nontabulated) point: xI
Predict fI : the value at x = xI.
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Suppose that Pn(x) is the nth Lagrange polynomial that agrees with
the function f at the distinct numbers x0, x1, ..., xn.
P(x) = Ln,0(x)f(x0) + Ln,1(x)f(x1) + · · · +, Ln,n(x)f(xn)
=
n
k=0
f(xk)Ln,k(x), where Ln,k(x) =
n
i=0
i=k
x − xi
xk − xi
,
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Suppose that Pn(x) is the nth Lagrange polynomial that agrees with
the function f at the distinct numbers x0, x1, ..., xn.
P(x) = Ln,0(x)f(x0) + Ln,1(x)f(x1) + · · · +, Ln,n(x)f(xn)
=
n
k=0
f(xk)Ln,k(x), where Ln,k(x) =
n
i=0
i=k
x − xi
xk − xi
,
Although this polynomial is unique, there are alternate algebraic
representations that are useful in certain situations. The divided
differences of f with respect to x0, x1, ..., xn are used to express Pn(x)
in the form
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Suppose that Pn(x) is the nth Lagrange polynomial that agrees with
the function f at the distinct numbers x0, x1, ..., xn.
P(x) = Ln,0(x)f(x0) + Ln,1(x)f(x1) + · · · +, Ln,n(x)f(xn)
=
n
k=0
f(xk)Ln,k(x), where Ln,k(x) =
n
i=0
i=k
x − xi
xk − xi
,
Although this polynomial is unique, there are alternate algebraic
representations that are useful in certain situations. The divided
differences of f with respect to x0, x1, ..., xn are used to express Pn(x)
in the form
Pn(x) = a0+a1(x−x0)+a2(x−x0)(x−x1)+ · · ·+an(x−x0) · · · (x−xn−1)
(1)
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Suppose that Pn(x) is the nth Lagrange polynomial that agrees with
the function f at the distinct numbers x0, x1, ..., xn.
P(x) = Ln,0(x)f(x0) + Ln,1(x)f(x1) + · · · +, Ln,n(x)f(xn)
=
n
k=0
f(xk)Ln,k(x), where Ln,k(x) =
n
i=0
i=k
x − xi
xk − xi
,
Although this polynomial is unique, there are alternate algebraic
representations that are useful in certain situations. The divided
differences of f with respect to x0, x1, ..., xn are used to express Pn(x)
in the form
Pn(x) = a0+a1(x−x0)+a2(x−x0)(x−x1)+ · · ·+an(x−x0) · · · (x−xn−1)
(1)
for appropriate constants
a0, a1, ..., an
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
For
Pn(x) = a0+a1(x−x0)+a2(x−x0)(x−x1)+ · · ·+an(x−x0) · · · (x−xn−1)
Pn(x) at x0 leaves
a0 = Pn(x0) = f0 (2)
Pn(x) at x1 leaves
Pn(x1) = a0 + a1(x1 − x0) we know
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
For
Pn(x) = a0+a1(x−x0)+a2(x−x0)(x−x1)+ · · ·+an(x−x0) · · · (x−xn−1)
Pn(x) at x0 leaves
a0 = Pn(x0) = f0 (2)
Pn(x) at x1 leaves
Pn(x1) = a0 + a1(x1 − x0) we know Pn(x1) = f1
a1 =
f1 − a0
x1 − x0
using (2), we get
a1 =
f1 − f0
x1 − x0
(3)
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Pn(x) at x2 leaves
Pn(x2) = a0 + a1(x2 − x0) + a2(x2 − x0)(x2 − x1)
we know Pn(x2) = f2
a2 =
f2 − a0 − a1(x2 − x0)
(x2 − x0)(x2 − x1)
using (2) and (3), we get
a2 =
f2 − f0 − f1−f0
x1−x0
(x2 − x0)
(x2 − x0)(x2 − x1)
After simplification we get
a2 =
f2−f1
x2−x1
− f1−f0
x1−x0
x2 − x0
(4)
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Comparing a0, a1 and a2 can we get some pattern?
a0 = f0
a1 =
f1 − f0
x1 − x0
a2 =
f2−f1
x2−x1
− f1−f0
x1−x0
x2 − x0
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Comparing a0, a1 and a2 can we get some pattern?
a0
depends on x0
= f0
a1
depends on x0 and x1
=
f1 − f0
x1 − x0
a2
depends on x0 x1 and x2
=
f2−f1
x2−x1
− f1−f0
x1−x0
x2 − x0
If we denote a0 = f0 as
f[x0]. Then its easy to write
a1 as
a1 =
f[x1] − f[x0]
x1 − x0
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Comparing a0, a1 and a2 can we get some pattern?
a0
depends on x0
= f0
a1
depends on x0 and x1
=
f1 − f0
x1 − x0
a2
depends on x0 x1 and x2
=
f2−f1
x2−x1
− f1−f0
x1−x0
x2 − x0
If we denote a0 = f0 as
f[x0]. Then its easy to write
a1 as
a1 =
f[x1] − f[x0]
x1 − x0
If we denote a1 = f[x0, x1]. Then
a2 =
f[x2, x1] − f[x1, x0]
x2 − x0
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
By looking at the pattern of a1 and a2 is it possible to write a3?
a1
f[x1,x0]
=
f[x1] − f[x0]
x1 − x0
a2
f[x2,x1,x0]
=
f[x2, x1] − f[x1, x0]
x2 − x0
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
By looking at the pattern of a1 and a2 is it possible to write a3?
a1
f[x1,x0]
=
f[x1] − f[x0]
x1 − x0
a2
f[x2,x1,x0]
=
f[x2, x1] − f[x1, x0]
x2 − x0
a3
f[x3,x2,x1,x0]
=
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
By looking at the pattern of a1 and a2 is it possible to write a3?
a1
f[x1,x0]
=
f[x1] − f[x0]
x1 − x0
a2
f[x2,x1,x0]
=
f[x2, x1] − f[x1, x0]
x2 − x0
a3
f[x3,x2,x1,x0]
=
f[
First three
x3, x2, x1] − f[
Last three
x2, x1, x0]
x3 − x0
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
By looking at the pattern of a1 and a2 is it possible to write a3?
a1
f[x1,x0]
=
f[x1] − f[x0]
x1 − x0
a2
f[x2,x1,x0]
=
f[x2, x1] − f[x1, x0]
x2 − x0
a3
f[x3,x2,x1,x0]
=
f[
First three
x3, x2, x1] − f[
Last three
x2, x1, x0]
x3 − x0
ak
f[x0,x1,··· ,xk]
=
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
By looking at the pattern of a1 and a2 is it possible to write a3?
a1
f[x1,x0]
=
f[x1] − f[x0]
x1 − x0
a2
f[x2,x1,x0]
=
f[x2, x1] − f[x1, x0]
x2 − x0
a3
f[x3,x2,x1,x0]
=
f[
First three
x3, x2, x1] − f[
Last three
x2, x1, x0]
x3 − x0
ak
f[x0,x1,··· ,xk]
=
f[
First k−1
... ] − f[
Last k−1
... ]
xk − x0
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Newton’s Divided Difference
Hence, the interpolating polynomial (1) may be expressed as
Pn(x) = f[x0] + f[x1, x0](x − x0) + a2(x − x0)(x − x1)+
· · · + an(x − x0)(x − x1) · · · (x − xn),
where
ak = f[xk, xk−1, · · · , x1, x0] for k = 0, 1, · · · , n.
f[xi] = f(xi) zeroth divided difference
f[xi+1, xi] =
f[xi+1] − f[xi]
xi+1 − xi
1st divided difference
f[xi+2, xi+1, xi] =
f[xi+2, xi+1] − f[xi+1, xi]
xi+2 − xi
2nd divided difference
f[x0, x1, · · · , xk] =
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Newton’s Divided Difference
Hence, the interpolating polynomial (1) may be expressed as
Pn(x) = f[x0] + f[x1, x0](x − x0) + a2(x − x0)(x − x1)+
· · · + an(x − x0)(x − x1) · · · (x − xn),
where
ak = f[xk, xk−1, · · · , x1, x0] for k = 0, 1, · · · , n.
f[xi] = f(xi) zeroth divided difference
f[xi+1, xi] =
f[xi+1] − f[xi]
xi+1 − xi
1st divided difference
f[xi+2, xi+1, xi] =
f[xi+2, xi+1] − f[xi+1, xi]
xi+2 − xi
2nd divided difference
f[x0, x1, · · · , xk] =
f[xk, xk−1 · · · , x1] − f[xk−1, xk−2, · · · , x0]
xk − x0
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Complete the Divided Difference table for the following data
x 1.0 1.3 1.6 1.9 2.2
f(x) 0.7651 0.6201 0.4554 0.2818 0.1103
i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3]
0 1.0 0.7651
♥
1 1.3 0.6201
2 1.6 0.4554
3 1.9 0.2818
4 2.2 0.1103
♥
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Complete the Divided Difference table for the following data
x 1.0 1.3 1.6 1.9 2.2
f(x) 0.7651 0.6201 0.4554 0.2818 0.1103
i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3]
0 1.0 0.7651
♥
1 1.3 0.6201
2 1.6 0.4554
3 1.9 0.2818
4 2.2 0.1103
♥ The First Divided Difference involving x0 and x1 is
f[x0, x1] =
f[x1] − f[x0]
x1 − x0
=
0.6201 − 0.7651
1.3 − 1.0
= −0.4833.
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Complete the Divided Difference table for the following data
x 1.0 1.3 1.6 1.9 2.2
f(x) 0.7651 0.6201 0.4554 0.2818 0.1103
i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3]
0 1.0 0.7651
♥
1 1.3 0.6201
2 1.6 0.4554
3 1.9 0.2818
4 2.2 0.1103
♥ The First Divided Difference involving x0 and x1 is
f[x0, x1] =
f[x1] − f[x0]
x1 − x0
=
0.6201 − 0.7651
1.3 − 1.0
= −0.4833.
Remaining First Divided Differences are as follows
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Complete the Divided Difference table for the following data
x 1.0 1.3 1.6 1.9 2.2
f(x) 0.7651 0.6201 0.4554 0.2818 0.1103
i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3]
0 1.0 0.7651
-0.4833
1 1.3 0.6201 ♠
-0.549
2 1.6 0.4554
-0.5787
3 1.9 0.2818
-0.5717
4 2.2 0.1103
♠
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Complete the Divided Difference table for the following data
x 1.0 1.3 1.6 1.9 2.2
f(x) 0.7651 0.6201 0.4554 0.2818 0.1103
i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3]
0 1.0 0.7651
-0.4833
1 1.3 0.6201 ♠
-0.549
2 1.6 0.4554
-0.5787
3 1.9 0.2818
-0.5717
4 2.2 0.1103
♠The Second Divided Difference involving x0, x1 and x2 is
f[x2, x1, x0] =
f[x2, x1] − f[x1, x0]
x2 − x0
=
−0.549 − (−0.4833)
1.6 − 1.0
= −0.1094
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Complete the Divided Difference table for the following data
x 1.0 1.3 1.6 1.9 2.2
f(x) 0.7651 0.6201 0.4554 0.2818 0.1103
i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3]
0 1.0 0.7651
-0.4833
1 1.3 0.6201 ♠
-0.549
2 1.6 0.4554
-0.5787
3 1.9 0.2818
-0.5717
4 2.2 0.1103
♠The Second Divided Difference involving x0, x1 and x2 is
f[x2, x1, x0] =
f[x2, x1] − f[x1, x0]
x2 − x0
=
−0.549 − (−0.4833)
1.6 − 1.0
= −0.1094
Remaining Second Divided Difference are as follows
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Complete the Divided Difference table for the following data
x 1.0 1.3 1.6 1.9 2.2
f(x) 0.7651 0.6201 0.4554 0.2818 0.1103
i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3]
0 1.0 0.7651
-0.4833
1 1.3 0.6201 -0.1094
-0.549 ♣
2 1.6 0.4554 -0.0494
-0.5787
3 1.9 0.2818 0.0117
-0.5717
4 2.2 0.1103
♣
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Complete the Divided Difference table for the following data
x 1.0 1.3 1.6 1.9 2.2
f(x) 0.7651 0.6201 0.4554 0.2818 0.1103
i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3]
0 1.0 0.7651
-0.4833
1 1.3 0.6201 -0.1094
-0.549 ♣
2 1.6 0.4554 -0.0494
-0.5787
3 1.9 0.2818 0.0117
-0.5717
4 2.2 0.1103
♣The Third Divided Difference f[x3, x2, x1, x0]
=
f[x3, x2, x1] − f[x2, x1, x0]
x3 − x0
=
−0.1094 − (−0.494)
1.9 − 1.0
= −0.0667
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Complete the Divided Difference table for the following data
x 1.0 1.3 1.6 1.9 2.2
f(x) 0.7651 0.6201 0.4554 0.2818 0.1103
i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3]
0 1.0 0.7651
-0.4833
1 1.3 0.6201 -0.1094
-0.549 ♣
2 1.6 0.4554 -0.0494
-0.5787
3 1.9 0.2818 0.0117
-0.5717
4 2.2 0.1103
♣The Third Divided Difference f[x3, x2, x1, x0]
=
f[x3, x2, x1] − f[x2, x1, x0]
x3 − x0
=
−0.1094 − (−0.494)
1.9 − 1.0
= −0.0667
Remaining Third Divided Differences are as follows
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Complete the Divided Difference table for the following data
x 1.0 1.3 1.6 1.9 2.2
f(x) 0.7651 0.6201 0.4554 0.2818 0.1103
i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3]
0 1.0 0.7651
-0.4833
1 1.3 0.6201 -0.1094
-0.549 -0.0667
2 1.6 0.4554 -0.0494
-0.5787 0.0679
3 1.9 0.2818 0.0117
-0.5717
4 2.2 0.1103
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Complete the Divided Difference table for the following data
x 1.0 1.3 1.6 1.9 2.2
f(x) 0.7651 0.6201 0.4554 0.2818 0.1103
i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3]
0 1.0 0.7651
-0.4833
1 1.3 0.6201 -0.1094
-0.549 -0.0667
2 1.6 0.4554 -0.0494
-0.5787 0.0679
3 1.9 0.2818 0.0117
-0.5717
4 2.2 0.1103
The Fourth Divided Difference f[x4, x3, x2, x1, x0]
=
f[x4, x3, x2, x1] − f[x3, x2, x1, x0]
x3 − x0
=
−0.0679 − (−0.0667)
2.2 − 1.0
= −0.001
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Complete the Divided Difference table for the following data
x 1.0 1.3 1.6 1.9 2.2
f(x) 0.7651 0.6201 0.4554 0.2818 0.1103
i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3]
0 1.0 0.7651
-0.4833
1 1.3 0.6201 -0.1094
-0.549 -0.0667
2 1.6 0.4554 -0.0494
-0.5787 0.0679
3 1.9 0.2818 0.0117
-0.5717
4 2.2 0.1103
The Fourth Divided Difference f[x4, x3, x2, x1, x0]
=
f[x4, x3, x2, x1] − f[x3, x2, x1, x0]
x3 − x0
=
−0.0679 − (−0.0667)
2.2 − 1.0
= −0.001
This would be last divided difference in this case.
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
The coefficients of the Newton forward divided-difference form of the
interpolating polynomial are along the diagonal in the table. This
polynomial is
P4(x) = 0.7651 − 0.4833(x − 1) − 1094(x − 1)(x − 1.3)+
−0667(x − 1)(x − 1.3)(x − 1.6) − 0.001(x − 1)(x − 1.3)(x − 1.6)(x − 1.9)
i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3]
0 1.0 0.7651
-0.4833
1 1.3 0.6201 -0.1094
-0.549 -0.0667
2 1.6 0.4554 -0.0494
-0.5787 0.0679
3 1.9 0.2818 0.0117
-0.5717
4 2.2 0.1103
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
The coefficients of the Newton forward divided-difference form of the
interpolating polynomial are along the diagonal in the table. This
polynomial is
P4(x) = 0.7651 − 0.4833(x − 1) − 1094(x − 1)(x − 1.3)+
−0667(x − 1)(x − 1.3)(x − 1.6) − 0.001(x − 1)(x − 1.3)(x − 1.6)(x − 1.9)
i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3]
0 1.0 0.7651
-0.4833
1 1.3 0.6201 -0.1094
-0.549 -0.0667
2 1.6 0.4554 -0.0494
-0.5787 0.0679
3 1.9 0.2818 0.0117
-0.5717
4 2.2 0.1103
f[x4, x3, x2, x1, x0] = −0.001
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Newton’s divided-difference formula can be expressed in a
simplified form when the nodes are arranged consecutively
with equal spacing. In this case, we introduce the notation
xi+1 − xi = h for each i = 0, 1, · · · , n − 1
Let x = x0 + sh, s ∈ R, then we can write
x − xi = (x0 + sh) − (x0 + ih)
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Newton’s divided-difference formula can be expressed in a
simplified form when the nodes are arranged consecutively
with equal spacing. In this case, we introduce the notation
xi+1 − xi = h for each i = 0, 1, · · · , n − 1
Let x = x0 + sh, s ∈ R, then we can write
x − xi = (x0 + sh) − (x0 + ih) ⇒ x − xi = (s − i)h
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Using x − xi = (s − i)h in
Pn(x) = f[x0] + f[x1, x0](x − x0) + a2(x − x0)(x − x1)+
· · · + an(x − x0)(x − x1) · · · (x − xn),
where
ak = f[xk, xk−1, · · · , x1, x0] for k = 0, 1, · · · , n.
We obtain
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Using x − xi = (s − i)h in
Pn(x) = f[x0] + f[x1, x0](x − x0) + a2(x − x0)(x − x1)+
· · · + an(x − x0)(x − x1) · · · (x − xn),
where
ak = f[xk, xk−1, · · · , x1, x0] for k = 0, 1, · · · , n.
We obtain
Pn(x) = Pn(x0 + sh) = f[x0] + shf[x1, x0] + s(s − 1)h2
f[x2, x1, x0]+
s(s − 1)(s − 2)h3
f[x3, x2, x1, x0] + · · · +
+s(s − 1)(s − 2) · · · (s − n + 1)hn
f[xn, xn−1, · · · , x0]
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Using x − xi = (s − i)h in
Pn(x) = f[x0] + f[x1, x0](x − x0) + a2(x − x0)(x − x1)+
· · · + an(x − x0)(x − x1) · · · (x − xn),
where
ak = f[xk, xk−1, · · · , x1, x0] for k = 0, 1, · · · , n.
We obtain
Pn(x) = Pn(x0 + sh) = f[x0] + shf[x1, x0] + s(s − 1)h2
f[x2, x1, x0]+
s(s − 1)(s − 2)h3
f[x3, x2, x1, x0] + · · · +
+s(s − 1)(s − 2) · · · (s − n + 1)hn
f[xn, xn−1, · · · , x0]
Note that
x − x0 = sh
x − x1 = (s − 1)h & x − x0 = sh ⇒
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Using x − xi = (s − i)h in
Pn(x) = f[x0] + f[x1, x0](x − x0) + a2(x − x0)(x − x1)+
· · · + an(x − x0)(x − x1) · · · (x − xn),
where
ak = f[xk, xk−1, · · · , x1, x0] for k = 0, 1, · · · , n.
We obtain
Pn(x) = Pn(x0 + sh) = f[x0] + shf[x1, x0] + s(s − 1)h2
f[x2, x1, x0]+
s(s − 1)(s − 2)h3
f[x3, x2, x1, x0] + · · · +
+s(s − 1)(s − 2) · · · (s − n + 1)hn
f[xn, xn−1, · · · , x0]
Note that
x − x0 = sh
x − x1 = (s − 1)h & x − x0 = sh ⇒ (x − x1)(x − x0) = s(s − 1)h2
similarly (x − x0)(x − x1)(x − x2) = s(s − 1)(s − 2)h3
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Equi-spaced Divided Difference
Pn(x0 + sh) = f[x0] +
n
k=1
s(s − 1) · · · (s − k + 1)hk
f[xk, xk−1, · · · , x0]
Using binomial-coefficient notation,
s
k
=
s(s − 1) · · · (s − k + 1)
k!
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Equi-spaced Divided Difference
Pn(x0 + sh) = f[x0] +
n
k=1
s(s − 1) · · · (s − k + 1)hk
f[xk, xk−1, · · · , x0]
Using binomial-coefficient notation,
s
k
=
s(s − 1) · · · (s − k + 1)
k!
⇒ s(s−1) · · · (s−k +1) = k!
s
k
.
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Equi-spaced Divided Difference
Pn(x0 + sh) = f[x0] +
n
k=1
s(s − 1) · · · (s − k + 1)hk
f[xk, xk−1, · · · , x0]
Using binomial-coefficient notation,
s
k
=
s(s − 1) · · · (s − k + 1)
k!
⇒ s(s−1) · · · (s−k +1) = k!
s
k
.
Thus we can express Pn(x) compactly as
Pn(x) = Pn(x0 + sh) = f[x0] +
n
k=1
k!
s
k
hk
f[xk, xk−1, · · · , x0]
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Newton forward-difference formula
The Newton forward-difference formula, is constructed by making use
of the forward difference notation ∆. With this notation,
f[x1, x0] =
f[x1] − f[x0]
x1 − x0
=
1
h
(f(x1) − f(x0)) =
1
h
∆f(x0)
Similarly
f[x2, x1, x0] =
f[x2, x1] − f[x1, x0]
x2 − x0
=
1
2h
(f[x2, x1] − f[x1, x0])
=
1
2h
1
h
(∆f(x1) − ∆f(x0))
=
1
2h2
(∆(f(x1) − f(x0)))
=
1
2h2
(∆(∆f(x0))) =
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Newton forward-difference formula
The Newton forward-difference formula, is constructed by making use
of the forward difference notation ∆. With this notation,
f[x1, x0] =
f[x1] − f[x0]
x1 − x0
=
1
h
(f(x1) − f(x0)) =
1
h
∆f(x0)
Similarly
f[x2, x1, x0] =
f[x2, x1] − f[x1, x0]
x2 − x0
=
1
2h
(f[x2, x1] − f[x1, x0])
=
1
2h
1
h
(∆f(x1) − ∆f(x0))
=
1
2h2
(∆(f(x1) − f(x0)))
=
1
2h2
(∆(∆f(x0))) =
1
2h2
∆2
f(x0)
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Newton forward-difference formula
Note that
f[x1, x0] =
1
h
∆f(x0)
f[x2, x1, x0] =
1
2h2
∆2
f(x0)
In general
f[xk, xk−1, · · · , x0] =
1
k!hk
∆k
f(x0)
Pn(x) = Pn(x0 + sh) = f[x0] +
n
k=1
k!
s
k
hk
f[xk, xk−1, · · · , x0]
Pn(x) = Pn(x0 + sh) = f(x0) +
n
k=1
s
k
∆k
f(x0)
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Compute cosh 0.56 using Newton’s Forward Difference
Formula (with 4 values)
i xi fi ∆fi ∆2fi ∆3fi
0 .5 1.127626
0.057839
1 .6 1.185465 0.011865
0.069704 0.000697
2 .7 1.255169 0.012562
0.082266
3 .8 1.337435
Using
P3(x) = P3(x0 + sh) = f(x0) +
3
k=1
s = x−x0
h
k
∆k
f(x0).
With x = 0.56, h = 0.1 and x0 = 0.5, we get
P3(0.56) = f(x0)+
0.6
1
∆f(x0)+
0.6
2
∆2
f(x0)+
0.6
3
∆3
f(x0).
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Compute cosh 0.56 using Newton’s Forward Difference
Formula (with 4 values)
i xi fi ∆fi ∆2fi ∆3fi
0 .5 1.127626
0.057839
1 .6 1.185465 0.011865
0.069704 0.000697
2 .7 1.255169 0.012562
0.082266
3 .8 1.337435
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Compute cosh 0.56 using Newton’s Forward Difference
Formula (with 4 values)
i xi fi ∆fi ∆2fi ∆3fi
0 .5 1.127626
0.057839
1 .6 1.185465 0.011865
0.069704 0.000697
2 .7 1.255169 0.012562
0.082266
3 .8 1.337435
Using
x = 0.56,
h = 0.1
and x0 = 0.5,
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Compute cosh 0.56 using Newton’s Forward Difference
Formula (with 4 values)
i xi fi ∆fi ∆2fi ∆3fi
0 .5 1.127626
0.057839
1 .6 1.185465 0.011865
0.069704 0.000697
2 .7 1.255169 0.012562
0.082266
3 .8 1.337435
Using
x = 0.56,
h = 0.1
and x0 = 0.5,
P3(0.56) = f(x0)+
0.6
1
∆f(x0)+
0.6
2
∆2
f(x0)+
0.6
3
∆3
f(x0).
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Compute cosh 0.56 using Newton’s Forward Difference
Formula (with 4 values)
i xi fi ∆fi ∆2fi ∆3fi
0 .5 1.127626
0.057839
1 .6 1.185465 0.011865
0.069704 0.000697
2 .7 1.255169 0.012562
0.082266
3 .8 1.337435
Using
x = 0.56,
h = 0.1
and x0 = 0.5,
P3(0.56) = f(x0)+
0.6
1
∆f(x0)+
0.6
2
∆2
f(x0)+
0.6
3
∆3
f(x0).
cosh(0.56) ≈ 1.127626 + (0.6)0.057839 +
(0.6)(−0.4)
2
0.011865+
(0.6)(−0.4)(−1.4)
6
0.000697 = 1.160944.
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Error in Newton’s Forwards Formula
εn =
hn+1
(n + 1)!
s(s − 1) · · · (s − n)f(n+1)
(t)
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Error in Newton’s Forwards Formula
εn =
hn+1
(n + 1)!
s(s − 1) · · · (s − n)f(n+1)
(t)
n = 3 f(t) = cosh t, f4
(t) = cosh(t)
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
Error in Newton’s Forwards Formula
εn =
hn+1
(n + 1)!
s(s − 1) · · · (s − n)f(n+1)
(t)
n = 3 f(t) = cosh t, f4
(t) = cosh(t)
ε3 =
(0.1)4
4!
0.6(−0.4)(−1.4)(−2.4)f(4)
(t) = −0.00000336 cosh t
We do not know t, but we get an inequality by taking the largest and
smallest cosh t in that interval:
A cosh 0.8 ≤ ε3(x) ≤ A cosh 0.5 where A = −0.00000336
Since
f(x) = P3(x) + ε3(x)
P3(0.56) + A cosh 0.8 ≤ cosh(0.56) ≤ P3(0.56)A cosh 0.5
1.160939 ≤ cosh(0.56) ≤ 1.160941.
Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics

More Related Content

What's hot

Langrange Interpolation Polynomials
Langrange Interpolation PolynomialsLangrange Interpolation Polynomials
Langrange Interpolation Polynomials
Sohaib H. Khan
 
Lesson 26: Integration by Substitution (slides)
Lesson 26: Integration by Substitution (slides)Lesson 26: Integration by Substitution (slides)
Lesson 26: Integration by Substitution (slides)
Matthew Leingang
 
APPLICATION OF PARTIAL DIFFERENTIATION
APPLICATION OF PARTIAL DIFFERENTIATIONAPPLICATION OF PARTIAL DIFFERENTIATION
APPLICATION OF PARTIAL DIFFERENTIATION
Dhrupal Patel
 
SERIES SOLUTION OF ORDINARY DIFFERENTIALL EQUATION
SERIES SOLUTION OF ORDINARY DIFFERENTIALL EQUATIONSERIES SOLUTION OF ORDINARY DIFFERENTIALL EQUATION
SERIES SOLUTION OF ORDINARY DIFFERENTIALL EQUATION
Kavin Raval
 
Newton’s Divided Difference Formula
Newton’s Divided Difference FormulaNewton’s Divided Difference Formula
Newton’s Divided Difference Formula
Jas Singh Bhasin
 
Partial Differentiation & Application
Partial Differentiation & Application Partial Differentiation & Application
Partial Differentiation & Application
Yana Qlah
 
2. Fixed Point Iteration.pptx
2. Fixed Point Iteration.pptx2. Fixed Point Iteration.pptx
2. Fixed Point Iteration.pptx
saadhaq6
 
Partial Differential Equation - Notes
Partial Differential Equation - NotesPartial Differential Equation - Notes
Partial Differential Equation - Notes
Dr. Nirav Vyas
 
Numerical analysis ppt
Numerical analysis pptNumerical analysis ppt
Numerical analysis ppt
MalathiNagarajan20
 
Runge kutta
Runge kuttaRunge kutta
Runge kutta
Shubham Tomar
 
Lagrange’s interpolation formula
Lagrange’s interpolation formulaLagrange’s interpolation formula
Lagrange’s interpolation formula
Mukunda Madhav Changmai
 
Metric space
Metric spaceMetric space
Metric space
NaliniSPatil
 
4.1 derivatives as rates linear motions
4.1 derivatives as rates linear motions4.1 derivatives as rates linear motions
4.1 derivatives as rates linear motions
math265
 
Bisection method
Bisection method Bisection method
Bisection method
DhaivikGowda
 
Lectures4 8
Lectures4 8Lectures4 8
Lectures4 8
KINGSHUKMUKHERJEE11
 
Interpolation
InterpolationInterpolation
Interpolation
Santhanam Krishnan
 
Introduction to differential equation
Introduction to differential equationIntroduction to differential equation
Introduction to differential equation
Islamic University, Kushtia
 
Runge-Kutta methods with examples
Runge-Kutta methods with examplesRunge-Kutta methods with examples
Runge-Kutta methods with examples
Sajjad Hossain
 
GATE Engineering Maths : Limit, Continuity and Differentiability
GATE Engineering Maths : Limit, Continuity and DifferentiabilityGATE Engineering Maths : Limit, Continuity and Differentiability
GATE Engineering Maths : Limit, Continuity and Differentiability
ParthDave57
 
DIFFERENTIAL EQUATIONS
DIFFERENTIAL EQUATIONSDIFFERENTIAL EQUATIONS
DIFFERENTIAL EQUATIONS
Urmila Bhardwaj
 

What's hot (20)

Langrange Interpolation Polynomials
Langrange Interpolation PolynomialsLangrange Interpolation Polynomials
Langrange Interpolation Polynomials
 
Lesson 26: Integration by Substitution (slides)
Lesson 26: Integration by Substitution (slides)Lesson 26: Integration by Substitution (slides)
Lesson 26: Integration by Substitution (slides)
 
APPLICATION OF PARTIAL DIFFERENTIATION
APPLICATION OF PARTIAL DIFFERENTIATIONAPPLICATION OF PARTIAL DIFFERENTIATION
APPLICATION OF PARTIAL DIFFERENTIATION
 
SERIES SOLUTION OF ORDINARY DIFFERENTIALL EQUATION
SERIES SOLUTION OF ORDINARY DIFFERENTIALL EQUATIONSERIES SOLUTION OF ORDINARY DIFFERENTIALL EQUATION
SERIES SOLUTION OF ORDINARY DIFFERENTIALL EQUATION
 
Newton’s Divided Difference Formula
Newton’s Divided Difference FormulaNewton’s Divided Difference Formula
Newton’s Divided Difference Formula
 
Partial Differentiation & Application
Partial Differentiation & Application Partial Differentiation & Application
Partial Differentiation & Application
 
2. Fixed Point Iteration.pptx
2. Fixed Point Iteration.pptx2. Fixed Point Iteration.pptx
2. Fixed Point Iteration.pptx
 
Partial Differential Equation - Notes
Partial Differential Equation - NotesPartial Differential Equation - Notes
Partial Differential Equation - Notes
 
Numerical analysis ppt
Numerical analysis pptNumerical analysis ppt
Numerical analysis ppt
 
Runge kutta
Runge kuttaRunge kutta
Runge kutta
 
Lagrange’s interpolation formula
Lagrange’s interpolation formulaLagrange’s interpolation formula
Lagrange’s interpolation formula
 
Metric space
Metric spaceMetric space
Metric space
 
4.1 derivatives as rates linear motions
4.1 derivatives as rates linear motions4.1 derivatives as rates linear motions
4.1 derivatives as rates linear motions
 
Bisection method
Bisection method Bisection method
Bisection method
 
Lectures4 8
Lectures4 8Lectures4 8
Lectures4 8
 
Interpolation
InterpolationInterpolation
Interpolation
 
Introduction to differential equation
Introduction to differential equationIntroduction to differential equation
Introduction to differential equation
 
Runge-Kutta methods with examples
Runge-Kutta methods with examplesRunge-Kutta methods with examples
Runge-Kutta methods with examples
 
GATE Engineering Maths : Limit, Continuity and Differentiability
GATE Engineering Maths : Limit, Continuity and DifferentiabilityGATE Engineering Maths : Limit, Continuity and Differentiability
GATE Engineering Maths : Limit, Continuity and Differentiability
 
DIFFERENTIAL EQUATIONS
DIFFERENTIAL EQUATIONSDIFFERENTIAL EQUATIONS
DIFFERENTIAL EQUATIONS
 

Similar to Newtons Divided Difference Formulation

Interpolation of Cubic Splines
Interpolation of Cubic SplinesInterpolation of Cubic Splines
Interpolation of Cubic Splines
Sohaib H. Khan
 
Finance Enginering from Columbia.pdf
Finance Enginering from Columbia.pdfFinance Enginering from Columbia.pdf
Finance Enginering from Columbia.pdf
CarlosLazo45
 
14 Bivariate Transformations
14 Bivariate Transformations14 Bivariate Transformations
14 Bivariate Transformations
Hadley Wickham
 
Newton’s Divided Difference Interpolation 18.pptx
Newton’s Divided Difference Interpolation 18.pptxNewton’s Divided Difference Interpolation 18.pptx
Newton’s Divided Difference Interpolation 18.pptx
RishabhGupta238479
 
11.a focus on a common fixed point theorem using weakly compatible mappings
11.a focus on a common fixed point theorem using weakly compatible mappings11.a focus on a common fixed point theorem using weakly compatible mappings
11.a focus on a common fixed point theorem using weakly compatible mappings
Alexander Decker
 
A focus on a common fixed point theorem using weakly compatible mappings
A focus on a common fixed point theorem using weakly compatible mappingsA focus on a common fixed point theorem using weakly compatible mappings
A focus on a common fixed point theorem using weakly compatible mappings
Alexander Decker
 
Interpolation functions
Interpolation functionsInterpolation functions
Interpolation functions
Tarun Gehlot
 
1.1_The_Definite_Integral.pdf odjoqwddoio
1.1_The_Definite_Integral.pdf odjoqwddoio1.1_The_Definite_Integral.pdf odjoqwddoio
1.1_The_Definite_Integral.pdf odjoqwddoio
NoorYassinHJamel
 
Differential Calculus
Differential Calculus Differential Calculus
Differential Calculus
OlooPundit
 
Limits and Continuity of Functions
Limits and Continuity of Functions Limits and Continuity of Functions
Limits and Continuity of Functions
OlooPundit
 
Interpolation
InterpolationInterpolation
Interpolation
Brijesh Padhiyar
 
Side 2019, part 2
Side 2019, part 2Side 2019, part 2
Side 2019, part 2
Arthur Charpentier
 
Numarical values
Numarical valuesNumarical values
Numarical values
AmanSaeed11
 
Numarical values highlighted
Numarical values highlightedNumarical values highlighted
Numarical values highlighted
AmanSaeed11
 
A Study on Intuitionistic Multi-Anti Fuzzy Subgroups
A Study on Intuitionistic Multi-Anti Fuzzy SubgroupsA Study on Intuitionistic Multi-Anti Fuzzy Subgroups
A Study on Intuitionistic Multi-Anti Fuzzy Subgroups
mathsjournal
 
A Study on Intuitionistic Multi-Anti Fuzzy Subgroups
A Study on Intuitionistic Multi-Anti Fuzzy Subgroups A Study on Intuitionistic Multi-Anti Fuzzy Subgroups
A Study on Intuitionistic Multi-Anti Fuzzy Subgroups
mathsjournal
 
Test Problems in Optimization
Test Problems in OptimizationTest Problems in Optimization
Test Problems in Optimization
Xin-She Yang
 
1- Matrices and their Applications.pdf
1- Matrices and their Applications.pdf1- Matrices and their Applications.pdf
1- Matrices and their Applications.pdf
d00a7ece
 
Cubic BF-Algebra
Cubic BF-AlgebraCubic BF-Algebra
Cubic BF-Algebra
AM Publications
 
138191 rvsp lecture notes
138191 rvsp lecture notes138191 rvsp lecture notes
138191 rvsp lecture notes
Ahmed Tayeh
 

Similar to Newtons Divided Difference Formulation (20)

Interpolation of Cubic Splines
Interpolation of Cubic SplinesInterpolation of Cubic Splines
Interpolation of Cubic Splines
 
Finance Enginering from Columbia.pdf
Finance Enginering from Columbia.pdfFinance Enginering from Columbia.pdf
Finance Enginering from Columbia.pdf
 
14 Bivariate Transformations
14 Bivariate Transformations14 Bivariate Transformations
14 Bivariate Transformations
 
Newton’s Divided Difference Interpolation 18.pptx
Newton’s Divided Difference Interpolation 18.pptxNewton’s Divided Difference Interpolation 18.pptx
Newton’s Divided Difference Interpolation 18.pptx
 
11.a focus on a common fixed point theorem using weakly compatible mappings
11.a focus on a common fixed point theorem using weakly compatible mappings11.a focus on a common fixed point theorem using weakly compatible mappings
11.a focus on a common fixed point theorem using weakly compatible mappings
 
A focus on a common fixed point theorem using weakly compatible mappings
A focus on a common fixed point theorem using weakly compatible mappingsA focus on a common fixed point theorem using weakly compatible mappings
A focus on a common fixed point theorem using weakly compatible mappings
 
Interpolation functions
Interpolation functionsInterpolation functions
Interpolation functions
 
1.1_The_Definite_Integral.pdf odjoqwddoio
1.1_The_Definite_Integral.pdf odjoqwddoio1.1_The_Definite_Integral.pdf odjoqwddoio
1.1_The_Definite_Integral.pdf odjoqwddoio
 
Differential Calculus
Differential Calculus Differential Calculus
Differential Calculus
 
Limits and Continuity of Functions
Limits and Continuity of Functions Limits and Continuity of Functions
Limits and Continuity of Functions
 
Interpolation
InterpolationInterpolation
Interpolation
 
Side 2019, part 2
Side 2019, part 2Side 2019, part 2
Side 2019, part 2
 
Numarical values
Numarical valuesNumarical values
Numarical values
 
Numarical values highlighted
Numarical values highlightedNumarical values highlighted
Numarical values highlighted
 
A Study on Intuitionistic Multi-Anti Fuzzy Subgroups
A Study on Intuitionistic Multi-Anti Fuzzy SubgroupsA Study on Intuitionistic Multi-Anti Fuzzy Subgroups
A Study on Intuitionistic Multi-Anti Fuzzy Subgroups
 
A Study on Intuitionistic Multi-Anti Fuzzy Subgroups
A Study on Intuitionistic Multi-Anti Fuzzy Subgroups A Study on Intuitionistic Multi-Anti Fuzzy Subgroups
A Study on Intuitionistic Multi-Anti Fuzzy Subgroups
 
Test Problems in Optimization
Test Problems in OptimizationTest Problems in Optimization
Test Problems in Optimization
 
1- Matrices and their Applications.pdf
1- Matrices and their Applications.pdf1- Matrices and their Applications.pdf
1- Matrices and their Applications.pdf
 
Cubic BF-Algebra
Cubic BF-AlgebraCubic BF-Algebra
Cubic BF-Algebra
 
138191 rvsp lecture notes
138191 rvsp lecture notes138191 rvsp lecture notes
138191 rvsp lecture notes
 

More from Sohaib H. Khan

Orthogonal Vector Spaces
Orthogonal Vector Spaces Orthogonal Vector Spaces
Orthogonal Vector Spaces
Sohaib H. Khan
 
Linear Transformation Vector Matrices and Spaces
Linear Transformation Vector Matrices and SpacesLinear Transformation Vector Matrices and Spaces
Linear Transformation Vector Matrices and Spaces
Sohaib H. Khan
 
Production Planning, Scheduling and Control
Production Planning, Scheduling and ControlProduction Planning, Scheduling and Control
Production Planning, Scheduling and Control
Sohaib H. Khan
 
Cfd ch08 continuity equations
Cfd ch08  continuity equationsCfd ch08  continuity equations
Cfd ch08 continuity equations
Sohaib H. Khan
 
Cfd ch07 hyperbolic_implicit
Cfd ch07 hyperbolic_implicitCfd ch07 hyperbolic_implicit
Cfd ch07 hyperbolic_implicit
Sohaib H. Khan
 
Cfd ch06 hyperbolic-explicit_2d
Cfd ch06 hyperbolic-explicit_2dCfd ch06 hyperbolic-explicit_2d
Cfd ch06 hyperbolic-explicit_2d
Sohaib H. Khan
 
Cfd ch05 hyperbolic-explicit_1d
Cfd ch05 hyperbolic-explicit_1dCfd ch05 hyperbolic-explicit_1d
Cfd ch05 hyperbolic-explicit_1d
Sohaib H. Khan
 
Cfd ch04 d_elliptic
Cfd ch04 d_ellipticCfd ch04 d_elliptic
Cfd ch04 d_elliptic
Sohaib H. Khan
 
Cfd ch03 c_linear-algebra
Cfd ch03 c_linear-algebraCfd ch03 c_linear-algebra
Cfd ch03 c_linear-algebra
Sohaib H. Khan
 
Cfd ch02 b_parabolic-implicit
Cfd ch02 b_parabolic-implicitCfd ch02 b_parabolic-implicit
Cfd ch02 b_parabolic-implicit
Sohaib H. Khan
 
Cfd ch01 a_parabolic_explicit
Cfd ch01 a_parabolic_explicitCfd ch01 a_parabolic_explicit
Cfd ch01 a_parabolic_explicit
Sohaib H. Khan
 

More from Sohaib H. Khan (11)

Orthogonal Vector Spaces
Orthogonal Vector Spaces Orthogonal Vector Spaces
Orthogonal Vector Spaces
 
Linear Transformation Vector Matrices and Spaces
Linear Transformation Vector Matrices and SpacesLinear Transformation Vector Matrices and Spaces
Linear Transformation Vector Matrices and Spaces
 
Production Planning, Scheduling and Control
Production Planning, Scheduling and ControlProduction Planning, Scheduling and Control
Production Planning, Scheduling and Control
 
Cfd ch08 continuity equations
Cfd ch08  continuity equationsCfd ch08  continuity equations
Cfd ch08 continuity equations
 
Cfd ch07 hyperbolic_implicit
Cfd ch07 hyperbolic_implicitCfd ch07 hyperbolic_implicit
Cfd ch07 hyperbolic_implicit
 
Cfd ch06 hyperbolic-explicit_2d
Cfd ch06 hyperbolic-explicit_2dCfd ch06 hyperbolic-explicit_2d
Cfd ch06 hyperbolic-explicit_2d
 
Cfd ch05 hyperbolic-explicit_1d
Cfd ch05 hyperbolic-explicit_1dCfd ch05 hyperbolic-explicit_1d
Cfd ch05 hyperbolic-explicit_1d
 
Cfd ch04 d_elliptic
Cfd ch04 d_ellipticCfd ch04 d_elliptic
Cfd ch04 d_elliptic
 
Cfd ch03 c_linear-algebra
Cfd ch03 c_linear-algebraCfd ch03 c_linear-algebra
Cfd ch03 c_linear-algebra
 
Cfd ch02 b_parabolic-implicit
Cfd ch02 b_parabolic-implicitCfd ch02 b_parabolic-implicit
Cfd ch02 b_parabolic-implicit
 
Cfd ch01 a_parabolic_explicit
Cfd ch01 a_parabolic_explicitCfd ch01 a_parabolic_explicit
Cfd ch01 a_parabolic_explicit
 

Recently uploaded

Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdfIron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
RadiNasr
 
CSM Cloud Service Management Presentarion
CSM Cloud Service Management PresentarionCSM Cloud Service Management Presentarion
CSM Cloud Service Management Presentarion
rpskprasana
 
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student MemberIEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
VICTOR MAESTRE RAMIREZ
 
Understanding Inductive Bias in Machine Learning
Understanding Inductive Bias in Machine LearningUnderstanding Inductive Bias in Machine Learning
Understanding Inductive Bias in Machine Learning
SUTEJAS
 
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdfBPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
MIGUELANGEL966976
 
DfMAy 2024 - key insights and contributions
DfMAy 2024 - key insights and contributionsDfMAy 2024 - key insights and contributions
DfMAy 2024 - key insights and contributions
gestioneergodomus
 
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMS
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMSA SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMS
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMS
IJNSA Journal
 
Low power architecture of logic gates using adiabatic techniques
Low power architecture of logic gates using adiabatic techniquesLow power architecture of logic gates using adiabatic techniques
Low power architecture of logic gates using adiabatic techniques
nooriasukmaningtyas
 
14 Template Contractual Notice - EOT Application
14 Template Contractual Notice - EOT Application14 Template Contractual Notice - EOT Application
14 Template Contractual Notice - EOT Application
SyedAbiiAzazi1
 
Recycled Concrete Aggregate in Construction Part III
Recycled Concrete Aggregate in Construction Part IIIRecycled Concrete Aggregate in Construction Part III
Recycled Concrete Aggregate in Construction Part III
Aditya Rajan Patra
 
Technical Drawings introduction to drawing of prisms
Technical Drawings introduction to drawing of prismsTechnical Drawings introduction to drawing of prisms
Technical Drawings introduction to drawing of prisms
heavyhaig
 
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTCHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
jpsjournal1
 
ACEP Magazine edition 4th launched on 05.06.2024
ACEP Magazine edition 4th launched on 05.06.2024ACEP Magazine edition 4th launched on 05.06.2024
ACEP Magazine edition 4th launched on 05.06.2024
Rahul
 
6th International Conference on Machine Learning & Applications (CMLA 2024)
6th International Conference on Machine Learning & Applications (CMLA 2024)6th International Conference on Machine Learning & Applications (CMLA 2024)
6th International Conference on Machine Learning & Applications (CMLA 2024)
ClaraZara1
 
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressions
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsKuberTENes Birthday Bash Guadalajara - K8sGPT first impressions
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressions
Victor Morales
 
Generative AI leverages algorithms to create various forms of content
Generative AI leverages algorithms to create various forms of contentGenerative AI leverages algorithms to create various forms of content
Generative AI leverages algorithms to create various forms of content
Hitesh Mohapatra
 
Exception Handling notes in java exception
Exception Handling notes in java exceptionException Handling notes in java exception
Exception Handling notes in java exception
Ratnakar Mikkili
 
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesHarnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Christina Lin
 
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
University of Maribor
 
Wearable antenna for antenna applications
Wearable antenna for antenna applicationsWearable antenna for antenna applications
Wearable antenna for antenna applications
Madhumitha Jayaram
 

Recently uploaded (20)

Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdfIron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
 
CSM Cloud Service Management Presentarion
CSM Cloud Service Management PresentarionCSM Cloud Service Management Presentarion
CSM Cloud Service Management Presentarion
 
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student MemberIEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
 
Understanding Inductive Bias in Machine Learning
Understanding Inductive Bias in Machine LearningUnderstanding Inductive Bias in Machine Learning
Understanding Inductive Bias in Machine Learning
 
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdfBPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
 
DfMAy 2024 - key insights and contributions
DfMAy 2024 - key insights and contributionsDfMAy 2024 - key insights and contributions
DfMAy 2024 - key insights and contributions
 
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMS
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMSA SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMS
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMS
 
Low power architecture of logic gates using adiabatic techniques
Low power architecture of logic gates using adiabatic techniquesLow power architecture of logic gates using adiabatic techniques
Low power architecture of logic gates using adiabatic techniques
 
14 Template Contractual Notice - EOT Application
14 Template Contractual Notice - EOT Application14 Template Contractual Notice - EOT Application
14 Template Contractual Notice - EOT Application
 
Recycled Concrete Aggregate in Construction Part III
Recycled Concrete Aggregate in Construction Part IIIRecycled Concrete Aggregate in Construction Part III
Recycled Concrete Aggregate in Construction Part III
 
Technical Drawings introduction to drawing of prisms
Technical Drawings introduction to drawing of prismsTechnical Drawings introduction to drawing of prisms
Technical Drawings introduction to drawing of prisms
 
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTCHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
 
ACEP Magazine edition 4th launched on 05.06.2024
ACEP Magazine edition 4th launched on 05.06.2024ACEP Magazine edition 4th launched on 05.06.2024
ACEP Magazine edition 4th launched on 05.06.2024
 
6th International Conference on Machine Learning & Applications (CMLA 2024)
6th International Conference on Machine Learning & Applications (CMLA 2024)6th International Conference on Machine Learning & Applications (CMLA 2024)
6th International Conference on Machine Learning & Applications (CMLA 2024)
 
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressions
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsKuberTENes Birthday Bash Guadalajara - K8sGPT first impressions
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressions
 
Generative AI leverages algorithms to create various forms of content
Generative AI leverages algorithms to create various forms of contentGenerative AI leverages algorithms to create various forms of content
Generative AI leverages algorithms to create various forms of content
 
Exception Handling notes in java exception
Exception Handling notes in java exceptionException Handling notes in java exception
Exception Handling notes in java exception
 
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesHarnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
 
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
 
Wearable antenna for antenna applications
Wearable antenna for antenna applicationsWearable antenna for antenna applications
Wearable antenna for antenna applications
 

Newtons Divided Difference Formulation

  • 1. Adv. Engg. Mathematics MTH-812 Divided Differences Interpolations Dr. Yasir Ali (yali@ceme.nust.edu.pk) DBS&H, CEME-NUST December 4, 2017 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 2. Interpolation Problem Given 1 The (n + 1) nodes: x0, x1, ..., xn 2 The functional values f0, f1, ..., fn at these nodes 3 An Intermediate (nontabulated) point: xI Predict fI : the value at x = xI. Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 3. Suppose that Pn(x) is the nth Lagrange polynomial that agrees with the function f at the distinct numbers x0, x1, ..., xn. P(x) = Ln,0(x)f(x0) + Ln,1(x)f(x1) + · · · +, Ln,n(x)f(xn) = n k=0 f(xk)Ln,k(x), where Ln,k(x) = n i=0 i=k x − xi xk − xi , Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 4. Suppose that Pn(x) is the nth Lagrange polynomial that agrees with the function f at the distinct numbers x0, x1, ..., xn. P(x) = Ln,0(x)f(x0) + Ln,1(x)f(x1) + · · · +, Ln,n(x)f(xn) = n k=0 f(xk)Ln,k(x), where Ln,k(x) = n i=0 i=k x − xi xk − xi , Although this polynomial is unique, there are alternate algebraic representations that are useful in certain situations. The divided differences of f with respect to x0, x1, ..., xn are used to express Pn(x) in the form Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 5. Suppose that Pn(x) is the nth Lagrange polynomial that agrees with the function f at the distinct numbers x0, x1, ..., xn. P(x) = Ln,0(x)f(x0) + Ln,1(x)f(x1) + · · · +, Ln,n(x)f(xn) = n k=0 f(xk)Ln,k(x), where Ln,k(x) = n i=0 i=k x − xi xk − xi , Although this polynomial is unique, there are alternate algebraic representations that are useful in certain situations. The divided differences of f with respect to x0, x1, ..., xn are used to express Pn(x) in the form Pn(x) = a0+a1(x−x0)+a2(x−x0)(x−x1)+ · · ·+an(x−x0) · · · (x−xn−1) (1) Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 6. Suppose that Pn(x) is the nth Lagrange polynomial that agrees with the function f at the distinct numbers x0, x1, ..., xn. P(x) = Ln,0(x)f(x0) + Ln,1(x)f(x1) + · · · +, Ln,n(x)f(xn) = n k=0 f(xk)Ln,k(x), where Ln,k(x) = n i=0 i=k x − xi xk − xi , Although this polynomial is unique, there are alternate algebraic representations that are useful in certain situations. The divided differences of f with respect to x0, x1, ..., xn are used to express Pn(x) in the form Pn(x) = a0+a1(x−x0)+a2(x−x0)(x−x1)+ · · ·+an(x−x0) · · · (x−xn−1) (1) for appropriate constants a0, a1, ..., an Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 7. For Pn(x) = a0+a1(x−x0)+a2(x−x0)(x−x1)+ · · ·+an(x−x0) · · · (x−xn−1) Pn(x) at x0 leaves a0 = Pn(x0) = f0 (2) Pn(x) at x1 leaves Pn(x1) = a0 + a1(x1 − x0) we know Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 8. For Pn(x) = a0+a1(x−x0)+a2(x−x0)(x−x1)+ · · ·+an(x−x0) · · · (x−xn−1) Pn(x) at x0 leaves a0 = Pn(x0) = f0 (2) Pn(x) at x1 leaves Pn(x1) = a0 + a1(x1 − x0) we know Pn(x1) = f1 a1 = f1 − a0 x1 − x0 using (2), we get a1 = f1 − f0 x1 − x0 (3) Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 9. Pn(x) at x2 leaves Pn(x2) = a0 + a1(x2 − x0) + a2(x2 − x0)(x2 − x1) we know Pn(x2) = f2 a2 = f2 − a0 − a1(x2 − x0) (x2 − x0)(x2 − x1) using (2) and (3), we get a2 = f2 − f0 − f1−f0 x1−x0 (x2 − x0) (x2 − x0)(x2 − x1) After simplification we get a2 = f2−f1 x2−x1 − f1−f0 x1−x0 x2 − x0 (4) Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 10. Comparing a0, a1 and a2 can we get some pattern? a0 = f0 a1 = f1 − f0 x1 − x0 a2 = f2−f1 x2−x1 − f1−f0 x1−x0 x2 − x0 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 11. Comparing a0, a1 and a2 can we get some pattern? a0 depends on x0 = f0 a1 depends on x0 and x1 = f1 − f0 x1 − x0 a2 depends on x0 x1 and x2 = f2−f1 x2−x1 − f1−f0 x1−x0 x2 − x0 If we denote a0 = f0 as f[x0]. Then its easy to write a1 as a1 = f[x1] − f[x0] x1 − x0 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 12. Comparing a0, a1 and a2 can we get some pattern? a0 depends on x0 = f0 a1 depends on x0 and x1 = f1 − f0 x1 − x0 a2 depends on x0 x1 and x2 = f2−f1 x2−x1 − f1−f0 x1−x0 x2 − x0 If we denote a0 = f0 as f[x0]. Then its easy to write a1 as a1 = f[x1] − f[x0] x1 − x0 If we denote a1 = f[x0, x1]. Then a2 = f[x2, x1] − f[x1, x0] x2 − x0 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 13. By looking at the pattern of a1 and a2 is it possible to write a3? a1 f[x1,x0] = f[x1] − f[x0] x1 − x0 a2 f[x2,x1,x0] = f[x2, x1] − f[x1, x0] x2 − x0 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 14. By looking at the pattern of a1 and a2 is it possible to write a3? a1 f[x1,x0] = f[x1] − f[x0] x1 − x0 a2 f[x2,x1,x0] = f[x2, x1] − f[x1, x0] x2 − x0 a3 f[x3,x2,x1,x0] = Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 15. By looking at the pattern of a1 and a2 is it possible to write a3? a1 f[x1,x0] = f[x1] − f[x0] x1 − x0 a2 f[x2,x1,x0] = f[x2, x1] − f[x1, x0] x2 − x0 a3 f[x3,x2,x1,x0] = f[ First three x3, x2, x1] − f[ Last three x2, x1, x0] x3 − x0 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 16. By looking at the pattern of a1 and a2 is it possible to write a3? a1 f[x1,x0] = f[x1] − f[x0] x1 − x0 a2 f[x2,x1,x0] = f[x2, x1] − f[x1, x0] x2 − x0 a3 f[x3,x2,x1,x0] = f[ First three x3, x2, x1] − f[ Last three x2, x1, x0] x3 − x0 ak f[x0,x1,··· ,xk] = Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 17. By looking at the pattern of a1 and a2 is it possible to write a3? a1 f[x1,x0] = f[x1] − f[x0] x1 − x0 a2 f[x2,x1,x0] = f[x2, x1] − f[x1, x0] x2 − x0 a3 f[x3,x2,x1,x0] = f[ First three x3, x2, x1] − f[ Last three x2, x1, x0] x3 − x0 ak f[x0,x1,··· ,xk] = f[ First k−1 ... ] − f[ Last k−1 ... ] xk − x0 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 18. Newton’s Divided Difference Hence, the interpolating polynomial (1) may be expressed as Pn(x) = f[x0] + f[x1, x0](x − x0) + a2(x − x0)(x − x1)+ · · · + an(x − x0)(x − x1) · · · (x − xn), where ak = f[xk, xk−1, · · · , x1, x0] for k = 0, 1, · · · , n. f[xi] = f(xi) zeroth divided difference f[xi+1, xi] = f[xi+1] − f[xi] xi+1 − xi 1st divided difference f[xi+2, xi+1, xi] = f[xi+2, xi+1] − f[xi+1, xi] xi+2 − xi 2nd divided difference f[x0, x1, · · · , xk] = Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 19. Newton’s Divided Difference Hence, the interpolating polynomial (1) may be expressed as Pn(x) = f[x0] + f[x1, x0](x − x0) + a2(x − x0)(x − x1)+ · · · + an(x − x0)(x − x1) · · · (x − xn), where ak = f[xk, xk−1, · · · , x1, x0] for k = 0, 1, · · · , n. f[xi] = f(xi) zeroth divided difference f[xi+1, xi] = f[xi+1] − f[xi] xi+1 − xi 1st divided difference f[xi+2, xi+1, xi] = f[xi+2, xi+1] − f[xi+1, xi] xi+2 − xi 2nd divided difference f[x0, x1, · · · , xk] = f[xk, xk−1 · · · , x1] − f[xk−1, xk−2, · · · , x0] xk − x0 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 20. Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 21. Complete the Divided Difference table for the following data x 1.0 1.3 1.6 1.9 2.2 f(x) 0.7651 0.6201 0.4554 0.2818 0.1103 i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3] 0 1.0 0.7651 ♥ 1 1.3 0.6201 2 1.6 0.4554 3 1.9 0.2818 4 2.2 0.1103 ♥ Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 22. Complete the Divided Difference table for the following data x 1.0 1.3 1.6 1.9 2.2 f(x) 0.7651 0.6201 0.4554 0.2818 0.1103 i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3] 0 1.0 0.7651 ♥ 1 1.3 0.6201 2 1.6 0.4554 3 1.9 0.2818 4 2.2 0.1103 ♥ The First Divided Difference involving x0 and x1 is f[x0, x1] = f[x1] − f[x0] x1 − x0 = 0.6201 − 0.7651 1.3 − 1.0 = −0.4833. Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 23. Complete the Divided Difference table for the following data x 1.0 1.3 1.6 1.9 2.2 f(x) 0.7651 0.6201 0.4554 0.2818 0.1103 i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3] 0 1.0 0.7651 ♥ 1 1.3 0.6201 2 1.6 0.4554 3 1.9 0.2818 4 2.2 0.1103 ♥ The First Divided Difference involving x0 and x1 is f[x0, x1] = f[x1] − f[x0] x1 − x0 = 0.6201 − 0.7651 1.3 − 1.0 = −0.4833. Remaining First Divided Differences are as follows Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 24. Complete the Divided Difference table for the following data x 1.0 1.3 1.6 1.9 2.2 f(x) 0.7651 0.6201 0.4554 0.2818 0.1103 i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3] 0 1.0 0.7651 -0.4833 1 1.3 0.6201 ♠ -0.549 2 1.6 0.4554 -0.5787 3 1.9 0.2818 -0.5717 4 2.2 0.1103 ♠ Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 25. Complete the Divided Difference table for the following data x 1.0 1.3 1.6 1.9 2.2 f(x) 0.7651 0.6201 0.4554 0.2818 0.1103 i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3] 0 1.0 0.7651 -0.4833 1 1.3 0.6201 ♠ -0.549 2 1.6 0.4554 -0.5787 3 1.9 0.2818 -0.5717 4 2.2 0.1103 ♠The Second Divided Difference involving x0, x1 and x2 is f[x2, x1, x0] = f[x2, x1] − f[x1, x0] x2 − x0 = −0.549 − (−0.4833) 1.6 − 1.0 = −0.1094 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 26. Complete the Divided Difference table for the following data x 1.0 1.3 1.6 1.9 2.2 f(x) 0.7651 0.6201 0.4554 0.2818 0.1103 i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3] 0 1.0 0.7651 -0.4833 1 1.3 0.6201 ♠ -0.549 2 1.6 0.4554 -0.5787 3 1.9 0.2818 -0.5717 4 2.2 0.1103 ♠The Second Divided Difference involving x0, x1 and x2 is f[x2, x1, x0] = f[x2, x1] − f[x1, x0] x2 − x0 = −0.549 − (−0.4833) 1.6 − 1.0 = −0.1094 Remaining Second Divided Difference are as follows Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 27. Complete the Divided Difference table for the following data x 1.0 1.3 1.6 1.9 2.2 f(x) 0.7651 0.6201 0.4554 0.2818 0.1103 i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3] 0 1.0 0.7651 -0.4833 1 1.3 0.6201 -0.1094 -0.549 ♣ 2 1.6 0.4554 -0.0494 -0.5787 3 1.9 0.2818 0.0117 -0.5717 4 2.2 0.1103 ♣ Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 28. Complete the Divided Difference table for the following data x 1.0 1.3 1.6 1.9 2.2 f(x) 0.7651 0.6201 0.4554 0.2818 0.1103 i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3] 0 1.0 0.7651 -0.4833 1 1.3 0.6201 -0.1094 -0.549 ♣ 2 1.6 0.4554 -0.0494 -0.5787 3 1.9 0.2818 0.0117 -0.5717 4 2.2 0.1103 ♣The Third Divided Difference f[x3, x2, x1, x0] = f[x3, x2, x1] − f[x2, x1, x0] x3 − x0 = −0.1094 − (−0.494) 1.9 − 1.0 = −0.0667 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 29. Complete the Divided Difference table for the following data x 1.0 1.3 1.6 1.9 2.2 f(x) 0.7651 0.6201 0.4554 0.2818 0.1103 i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3] 0 1.0 0.7651 -0.4833 1 1.3 0.6201 -0.1094 -0.549 ♣ 2 1.6 0.4554 -0.0494 -0.5787 3 1.9 0.2818 0.0117 -0.5717 4 2.2 0.1103 ♣The Third Divided Difference f[x3, x2, x1, x0] = f[x3, x2, x1] − f[x2, x1, x0] x3 − x0 = −0.1094 − (−0.494) 1.9 − 1.0 = −0.0667 Remaining Third Divided Differences are as follows Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 30. Complete the Divided Difference table for the following data x 1.0 1.3 1.6 1.9 2.2 f(x) 0.7651 0.6201 0.4554 0.2818 0.1103 i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3] 0 1.0 0.7651 -0.4833 1 1.3 0.6201 -0.1094 -0.549 -0.0667 2 1.6 0.4554 -0.0494 -0.5787 0.0679 3 1.9 0.2818 0.0117 -0.5717 4 2.2 0.1103 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 31. Complete the Divided Difference table for the following data x 1.0 1.3 1.6 1.9 2.2 f(x) 0.7651 0.6201 0.4554 0.2818 0.1103 i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3] 0 1.0 0.7651 -0.4833 1 1.3 0.6201 -0.1094 -0.549 -0.0667 2 1.6 0.4554 -0.0494 -0.5787 0.0679 3 1.9 0.2818 0.0117 -0.5717 4 2.2 0.1103 The Fourth Divided Difference f[x4, x3, x2, x1, x0] = f[x4, x3, x2, x1] − f[x3, x2, x1, x0] x3 − x0 = −0.0679 − (−0.0667) 2.2 − 1.0 = −0.001 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 32. Complete the Divided Difference table for the following data x 1.0 1.3 1.6 1.9 2.2 f(x) 0.7651 0.6201 0.4554 0.2818 0.1103 i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3] 0 1.0 0.7651 -0.4833 1 1.3 0.6201 -0.1094 -0.549 -0.0667 2 1.6 0.4554 -0.0494 -0.5787 0.0679 3 1.9 0.2818 0.0117 -0.5717 4 2.2 0.1103 The Fourth Divided Difference f[x4, x3, x2, x1, x0] = f[x4, x3, x2, x1] − f[x3, x2, x1, x0] x3 − x0 = −0.0679 − (−0.0667) 2.2 − 1.0 = −0.001 This would be last divided difference in this case. Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 33. The coefficients of the Newton forward divided-difference form of the interpolating polynomial are along the diagonal in the table. This polynomial is P4(x) = 0.7651 − 0.4833(x − 1) − 1094(x − 1)(x − 1.3)+ −0667(x − 1)(x − 1.3)(x − 1.6) − 0.001(x − 1)(x − 1.3)(x − 1.6)(x − 1.9) i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3] 0 1.0 0.7651 -0.4833 1 1.3 0.6201 -0.1094 -0.549 -0.0667 2 1.6 0.4554 -0.0494 -0.5787 0.0679 3 1.9 0.2818 0.0117 -0.5717 4 2.2 0.1103 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 34. The coefficients of the Newton forward divided-difference form of the interpolating polynomial are along the diagonal in the table. This polynomial is P4(x) = 0.7651 − 0.4833(x − 1) − 1094(x − 1)(x − 1.3)+ −0667(x − 1)(x − 1.3)(x − 1.6) − 0.001(x − 1)(x − 1.3)(x − 1.6)(x − 1.9) i xi f[xi] f[xi, xi−1] f[xi, xi−1, xi−2] f[xi, xi−1, xi−2, xi−3] 0 1.0 0.7651 -0.4833 1 1.3 0.6201 -0.1094 -0.549 -0.0667 2 1.6 0.4554 -0.0494 -0.5787 0.0679 3 1.9 0.2818 0.0117 -0.5717 4 2.2 0.1103 f[x4, x3, x2, x1, x0] = −0.001 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 35. Newton’s divided-difference formula can be expressed in a simplified form when the nodes are arranged consecutively with equal spacing. In this case, we introduce the notation xi+1 − xi = h for each i = 0, 1, · · · , n − 1 Let x = x0 + sh, s ∈ R, then we can write x − xi = (x0 + sh) − (x0 + ih) Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 36. Newton’s divided-difference formula can be expressed in a simplified form when the nodes are arranged consecutively with equal spacing. In this case, we introduce the notation xi+1 − xi = h for each i = 0, 1, · · · , n − 1 Let x = x0 + sh, s ∈ R, then we can write x − xi = (x0 + sh) − (x0 + ih) ⇒ x − xi = (s − i)h Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 37. Using x − xi = (s − i)h in Pn(x) = f[x0] + f[x1, x0](x − x0) + a2(x − x0)(x − x1)+ · · · + an(x − x0)(x − x1) · · · (x − xn), where ak = f[xk, xk−1, · · · , x1, x0] for k = 0, 1, · · · , n. We obtain Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 38. Using x − xi = (s − i)h in Pn(x) = f[x0] + f[x1, x0](x − x0) + a2(x − x0)(x − x1)+ · · · + an(x − x0)(x − x1) · · · (x − xn), where ak = f[xk, xk−1, · · · , x1, x0] for k = 0, 1, · · · , n. We obtain Pn(x) = Pn(x0 + sh) = f[x0] + shf[x1, x0] + s(s − 1)h2 f[x2, x1, x0]+ s(s − 1)(s − 2)h3 f[x3, x2, x1, x0] + · · · + +s(s − 1)(s − 2) · · · (s − n + 1)hn f[xn, xn−1, · · · , x0] Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 39. Using x − xi = (s − i)h in Pn(x) = f[x0] + f[x1, x0](x − x0) + a2(x − x0)(x − x1)+ · · · + an(x − x0)(x − x1) · · · (x − xn), where ak = f[xk, xk−1, · · · , x1, x0] for k = 0, 1, · · · , n. We obtain Pn(x) = Pn(x0 + sh) = f[x0] + shf[x1, x0] + s(s − 1)h2 f[x2, x1, x0]+ s(s − 1)(s − 2)h3 f[x3, x2, x1, x0] + · · · + +s(s − 1)(s − 2) · · · (s − n + 1)hn f[xn, xn−1, · · · , x0] Note that x − x0 = sh x − x1 = (s − 1)h & x − x0 = sh ⇒ Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 40. Using x − xi = (s − i)h in Pn(x) = f[x0] + f[x1, x0](x − x0) + a2(x − x0)(x − x1)+ · · · + an(x − x0)(x − x1) · · · (x − xn), where ak = f[xk, xk−1, · · · , x1, x0] for k = 0, 1, · · · , n. We obtain Pn(x) = Pn(x0 + sh) = f[x0] + shf[x1, x0] + s(s − 1)h2 f[x2, x1, x0]+ s(s − 1)(s − 2)h3 f[x3, x2, x1, x0] + · · · + +s(s − 1)(s − 2) · · · (s − n + 1)hn f[xn, xn−1, · · · , x0] Note that x − x0 = sh x − x1 = (s − 1)h & x − x0 = sh ⇒ (x − x1)(x − x0) = s(s − 1)h2 similarly (x − x0)(x − x1)(x − x2) = s(s − 1)(s − 2)h3 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 41. Equi-spaced Divided Difference Pn(x0 + sh) = f[x0] + n k=1 s(s − 1) · · · (s − k + 1)hk f[xk, xk−1, · · · , x0] Using binomial-coefficient notation, s k = s(s − 1) · · · (s − k + 1) k! Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 42. Equi-spaced Divided Difference Pn(x0 + sh) = f[x0] + n k=1 s(s − 1) · · · (s − k + 1)hk f[xk, xk−1, · · · , x0] Using binomial-coefficient notation, s k = s(s − 1) · · · (s − k + 1) k! ⇒ s(s−1) · · · (s−k +1) = k! s k . Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 43. Equi-spaced Divided Difference Pn(x0 + sh) = f[x0] + n k=1 s(s − 1) · · · (s − k + 1)hk f[xk, xk−1, · · · , x0] Using binomial-coefficient notation, s k = s(s − 1) · · · (s − k + 1) k! ⇒ s(s−1) · · · (s−k +1) = k! s k . Thus we can express Pn(x) compactly as Pn(x) = Pn(x0 + sh) = f[x0] + n k=1 k! s k hk f[xk, xk−1, · · · , x0] Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 44. Newton forward-difference formula The Newton forward-difference formula, is constructed by making use of the forward difference notation ∆. With this notation, f[x1, x0] = f[x1] − f[x0] x1 − x0 = 1 h (f(x1) − f(x0)) = 1 h ∆f(x0) Similarly f[x2, x1, x0] = f[x2, x1] − f[x1, x0] x2 − x0 = 1 2h (f[x2, x1] − f[x1, x0]) = 1 2h 1 h (∆f(x1) − ∆f(x0)) = 1 2h2 (∆(f(x1) − f(x0))) = 1 2h2 (∆(∆f(x0))) = Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 45. Newton forward-difference formula The Newton forward-difference formula, is constructed by making use of the forward difference notation ∆. With this notation, f[x1, x0] = f[x1] − f[x0] x1 − x0 = 1 h (f(x1) − f(x0)) = 1 h ∆f(x0) Similarly f[x2, x1, x0] = f[x2, x1] − f[x1, x0] x2 − x0 = 1 2h (f[x2, x1] − f[x1, x0]) = 1 2h 1 h (∆f(x1) − ∆f(x0)) = 1 2h2 (∆(f(x1) − f(x0))) = 1 2h2 (∆(∆f(x0))) = 1 2h2 ∆2 f(x0) Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 46. Newton forward-difference formula Note that f[x1, x0] = 1 h ∆f(x0) f[x2, x1, x0] = 1 2h2 ∆2 f(x0) In general f[xk, xk−1, · · · , x0] = 1 k!hk ∆k f(x0) Pn(x) = Pn(x0 + sh) = f[x0] + n k=1 k! s k hk f[xk, xk−1, · · · , x0] Pn(x) = Pn(x0 + sh) = f(x0) + n k=1 s k ∆k f(x0) Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 47. Compute cosh 0.56 using Newton’s Forward Difference Formula (with 4 values) i xi fi ∆fi ∆2fi ∆3fi 0 .5 1.127626 0.057839 1 .6 1.185465 0.011865 0.069704 0.000697 2 .7 1.255169 0.012562 0.082266 3 .8 1.337435 Using P3(x) = P3(x0 + sh) = f(x0) + 3 k=1 s = x−x0 h k ∆k f(x0). With x = 0.56, h = 0.1 and x0 = 0.5, we get P3(0.56) = f(x0)+ 0.6 1 ∆f(x0)+ 0.6 2 ∆2 f(x0)+ 0.6 3 ∆3 f(x0). Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 48. Compute cosh 0.56 using Newton’s Forward Difference Formula (with 4 values) i xi fi ∆fi ∆2fi ∆3fi 0 .5 1.127626 0.057839 1 .6 1.185465 0.011865 0.069704 0.000697 2 .7 1.255169 0.012562 0.082266 3 .8 1.337435 Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 49. Compute cosh 0.56 using Newton’s Forward Difference Formula (with 4 values) i xi fi ∆fi ∆2fi ∆3fi 0 .5 1.127626 0.057839 1 .6 1.185465 0.011865 0.069704 0.000697 2 .7 1.255169 0.012562 0.082266 3 .8 1.337435 Using x = 0.56, h = 0.1 and x0 = 0.5, Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 50. Compute cosh 0.56 using Newton’s Forward Difference Formula (with 4 values) i xi fi ∆fi ∆2fi ∆3fi 0 .5 1.127626 0.057839 1 .6 1.185465 0.011865 0.069704 0.000697 2 .7 1.255169 0.012562 0.082266 3 .8 1.337435 Using x = 0.56, h = 0.1 and x0 = 0.5, P3(0.56) = f(x0)+ 0.6 1 ∆f(x0)+ 0.6 2 ∆2 f(x0)+ 0.6 3 ∆3 f(x0). Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 51. Compute cosh 0.56 using Newton’s Forward Difference Formula (with 4 values) i xi fi ∆fi ∆2fi ∆3fi 0 .5 1.127626 0.057839 1 .6 1.185465 0.011865 0.069704 0.000697 2 .7 1.255169 0.012562 0.082266 3 .8 1.337435 Using x = 0.56, h = 0.1 and x0 = 0.5, P3(0.56) = f(x0)+ 0.6 1 ∆f(x0)+ 0.6 2 ∆2 f(x0)+ 0.6 3 ∆3 f(x0). cosh(0.56) ≈ 1.127626 + (0.6)0.057839 + (0.6)(−0.4) 2 0.011865+ (0.6)(−0.4)(−1.4) 6 0.000697 = 1.160944. Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 52. Error in Newton’s Forwards Formula εn = hn+1 (n + 1)! s(s − 1) · · · (s − n)f(n+1) (t) Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 53. Error in Newton’s Forwards Formula εn = hn+1 (n + 1)! s(s − 1) · · · (s − n)f(n+1) (t) n = 3 f(t) = cosh t, f4 (t) = cosh(t) Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics
  • 54. Error in Newton’s Forwards Formula εn = hn+1 (n + 1)! s(s − 1) · · · (s − n)f(n+1) (t) n = 3 f(t) = cosh t, f4 (t) = cosh(t) ε3 = (0.1)4 4! 0.6(−0.4)(−1.4)(−2.4)f(4) (t) = −0.00000336 cosh t We do not know t, but we get an inequality by taking the largest and smallest cosh t in that interval: A cosh 0.8 ≤ ε3(x) ≤ A cosh 0.5 where A = −0.00000336 Since f(x) = P3(x) + ε3(x) P3(0.56) + A cosh 0.8 ≤ cosh(0.56) ≤ P3(0.56)A cosh 0.5 1.160939 ≤ cosh(0.56) ≤ 1.160941. Dr. Yasir Ali (yali@ceme.nust.edu.pk) Adv. Engg. Mathematics