Interpolation

Interpolation: Interpolation has been defined as the art of reading between the lines
of a table, and in elementary mathematics the term usually denotes the process of
computing intermediate values of a function from a set of given or tabular values of
that function.
In higher mathematics we frequently have to deal with functions whose analytical
form is either totally unknown or else is of such a nature (complicated or otherwise)
that the function can not easily be subjected to such operations as may be required. In
either case it is desirable to replace the given function by another which can be more
readily handled. This operation of replacing or representing a given function by a
simpler one constitutes interpolation in the broad sense of the term.
Example:

Find the value of y between the ranges [1, 2] is the interpolation.

Differences:
If denote a set of values of any functions , then ,
, ,……. are called the first differences of the function .
Denoting the differences by etc., we have ,
, ………. , , .
The differences of these first differences are called second differences. Denoting them by
etc.,
we have , ,

, etc.,.
In like manner, the third differences are
,
In like manner, the forth differences are
,

Forward difference Table:

 x y y 2 y 3 y 4 y 5 y 6 y

x0 y 0
y 0
2
x1 y1  y 0

y1 3 y 0
2 4
x 2 y 2
 y1  y 0

y 3 y1 
5
y 0
2
x3 y3 
2
y 2 
4
y1 
6
y 0
3
y 3  y 2 5 y1
x 4 y 4 2 y3 4 y 2
y 4 
3
y3
x5 y5 2 y 4
y 5
x6 y 6

Table1: Diagonal difference table

Backward difference:
, , ………. , , .
, ,
.
, .
.

Backward difference table:

2 3 4 5 6
x y y  y  y  y  y  y

x0 y 0

x1 y1 y1
2
x y y  y 2
2 2 2

2 3
x3 y3 y 3  y3  y3

3 4
x 4 y 4 y 4  2
y  y 4
 y 4
4

4 5
x5 y5 y 5  2
y5 
3
y5  y5  y5

6
x6 y 6 y 6 2

3
y 
4
y  5
y  y
 y 6 6 6 6 6

Table1: Horizontal difference table

Relation:

(going forward from )

(going backward from )
Where m denotes the order of differences and k and n are the numbers of the
tabulated value.
Newton’s formula for forward Interpolation:
Let denote a function which takes the values for the
equidistant values of the independent variable and let
denote a polynomial of the th degree. This polynomial may be written in the form

(1)
We shall now determine the coefficients so as to make
. Substituting in (1) the successive
values for , at the same time putting etc.,
and remembering that etc, we have
or

Similarly,

Substituting these values of in (1), we get

(2)
This is called Newton’s formula for forward interpolation in terms of .
The formula (2) can be written as

(3)

Now put , or

Then since etc., we have

……………………………………………………………………..

Substituting in (3) these values of etc., in (3), we get

(4)
This is the form in which Newton’s formula for forward interpolation is usually
written. The reason for the name “forward” interpolation formula lies in the fact that
the formula contains values of the tabulated function from onward to the right
(forward from ) and none to the left of this value. Because of this fact this formula
is used mainly for interpolating values of near the beginning of a set of tabular
values and for extrapolating values of a short distance backward (to the left) from
.

Newton’s formula for backward Interpolation:

The formulas of the preceding section can not be used for interpolating a value of
near the end of the tabular values. To derive a formula for this case we write the
polynomial in the following form:

(5)
We shall now determine the coefficients so as to make
. Substituting in (5) the successive values
for , at the same time putting etc., we
have
or

Similarly,

Substituting these values of in (5), we get

(6)
This is called Newton’s formula for backward interpolation in terms of .
The formula (6) can be written as

(7)

Now put , or

Then since etc., we have

……………………………………………………………………..

Substituting in (3) these values of etc., in (7), we get

(8)

This is the form in which Newton’s formula for backward interpolation is usually
written. Eq. (8) is called the formula for “backward” interpolation because it
contains values of the tabulated function from backward to the left (backward
from ) and none to the right of . This formula is used mainly for interpolating
values of near the end of a set of tabular values and for extrapolating values of a
short distance ahead(to the right) of .
Example1: The velocity distribution of a fluid near a flat surface is given below:
x 0.1 0.3 0.5 0.7 0.9
v 0.72 1.81 2.73 3.47 3.98
X is the distance from the surface (cm) and v is the velocity (cm/sec). Using a
suitable interpolation formula obtain the velocity at x=0.2 and 0.8.
Solution: First we prepare difference table as follow

The Newton’s forward formula is

Here, , , , ,

The Newton’s backward formula is

Here, , , , ,

Interpolation with unequal interval of the arguments

Divided differences:
Let denotes functional values corresponding to any values
of the argument. Then the divided differences of in ascending order
are defined as follows:
First order divided differences:

, , ,

Second order divided differences:

, ,

, etc.,

Third order divided differences:

Fourth order divided differences:

 .

Note that the order of any divided difference is less than the number of values of the
argument in it.

Relation between divided difference and simple differences:

From these tables we see, for example, that

And more generally,

Newton’s General Interpolation formula:

Newton’s general interpolation formula for unequal intervals of the argument can be
derived by starting with any variable pair of values and and the pair of given
values, writing down the divided differences in ascending order, then solving for in
successive steps until as many terms as desired are found.
Thus:

(1)

(2)

(3)

(4)
From (1),
. (5)
From (2),
.
(6)
Substitute into (5) this value of and get

(7)
From (3),
.
(8)
Substitute this into (7) and get

(9)
From (4),
(10)
Substitute this into (9) and get

(11)
By continue in this manner, or by mathematical induction, it can be proved that the general Newton
formula with divided differences is

(12)
We know the n-th difference of polynomial of degree n is constant, hence its (n+1)-th
difference is zero. i.e., .

Now the eq. (12) becomes,

(13)
This is called Newton’s general interpolation formula.

Note:

If ,

Then eq. (13) becomes.

(14)
This is Newton’s formula for forward interpolation.

Symmetry of Divided differences:

Divided differences are symmetric function of their arguments, as below for
particular cases.

Also,

The right hand members of the above equations remain unchanged when any two
values of are interchanged and the corresponding y’s are also interchanged. This
means that a divided difference remains unchanged regardless of how much its
arguments are interchanged. Thus, , etc.
, etc.
It can be proved by mathematical induction that

Lagrange’s Interpolation Formula:

We know that,
 (1)

Let denote a polynomial of the nth degree which takes the values
when has the values respectively. Then the
(n+1) th differences of this polynomial are zero. Hence and
(1) becomes

Transposing to the right-hand side all terms except the first, we have

Solving for and then canceling the common factors

In the several terms, we get

(2

)
This is Lagrange’s formula and is seen to give when
, respectively. The values of independent variable may or may not
be equidistant.
Hence on interchanging and in (2), we get
 (

3)
The chief uses of Lagrange’s formula are two: (i) to find any value of a function
when the given vales of the independent variable are not equidistant, and (ii) to find
the value of the independent variable corresponding to a given value of the function.

Example2: The following values of the function for values of are given:
1 2 7 8
4 5 5 4
Find the value of and also the value of for which is maximum or
minimum.
Solution: First we prepare the divided difference table as follow

The Newton’s general interpolation formula is

Here, , , , , , .
Again for maximum or minimum of , we have
i.e.,

Since , therefore is maximum at at the point .

Central Difference Interpolation Formulas

Gauss’s central difference interpolation formulas:
Gauss’s forward formula:
The Newton’s general interpolation formula is

(1)
In (1) put , , , , , ,
.

(2)

Now put . Then (2) becomes

 (3)

We know

, , ,

Substituting these into (3) and canceling the powers of in each term, we get

(A)

This is the Gauss forward formula.

Gauss’s backward formula:
In (1) put , , , , , ,
and applying above procedure, we get

(B)

which is the Gauss backward formula.

A third Gauss’s formula:
To derive such a formula we advanced the subscripts of and in (B) by one unit
and by . These changes then reduces (B) to

(C)
Stirling’s Interpolation formula: Adding (A) and (B) and divided by 2, we get

(D)

Bessel’s Interpolation formula: Adding (A) and (C) and divided by 2, we get

(E)

Note: As a general rule it may be stated that Bessel’s formula will give a more
accurate result when interpolating near the middle of an interval, say from
; whereas Stirling’s formula will give better result when interpolating
near the beginning or end of an interval, from , say.

Central Difference Table: