Term Paper

OF

Maths
Difference between interpolation and
extraplotion

SUBMITTED TO: Submitted by:

Shweta mam Bharat mahajan

10804574

RM2801B33

B Tech IT
Differnce between interpolation and extrapolation
Interpolation

Discussed here are a number of interpolation methods, this is by no means an

exhaustive list but the methods shown tend to be those in common use in
computer graphics. The main attributes is that they are easy to compute and are
stable. Interpolation as used here is different to "smoothing", the techniques
discussed here have the characteristic that the estimated curve passes through
all the given points. The idea is that the points are in some sense correct and lie
on an underlying but unknown curve, the problem is to be able to estimate the
values of the curve at any position between the known points. interpolation is a
method of constructing new data points within the range of a discrete set of
known data points.

In engineering and science one often has a number of data points, as obtained
by sampling or experimentation, and tries to construct a function which closely
fits those data points. This is called curve fitting or regression analysis.
Interpolation is a specific case of curve fitting, in which the function must go
exactly through the data points.
A different problem which is closely related to interpolation is the approximation
of a complicated function by a simple function. Suppose we know the function but
it is too complex to evaluate efficiently. Then we could pick a few known data
points from the complicated function, creating a lookup table, and try to
interpolate those data points to construct a simpler function. Of course, when
using the simple function to calculate new data points we usually do not receive
the same result as when using the original function, but depending on the
problem domain and the interpolation method used the gain in simplicity might
offset the error.

It should be mentioned that there is another very different kind of interpolation in

mathematics, namely the "interpolation of operators". The classical results about
interpolation of operators are the Riesz–Thorin theorem and the Marcinkiewicz
theorem. There are also many other subsequent results.

INTERPOLATION METHODS

Piecewise constant interpolation

The simplest interpolation method is to locate the nearest data value, and assign the same value.
In one dimension, there are seldom good reasons to choose this one over linear interpolation,
which is almost as cheap, but in higher dimensional multivariate interpolation, this can be a
favourable choice for its speed and simplicity.
Linear interpolation

One of the simplest methods is linear interpolation (sometimes known as lerp). Consider the
above example of determining f(2.5). Since 2.5 is midway between 2 and 3, it is reasonable to
take f(2.5) midway between f(2) = 0.9093 and f(3) = 0.1411, which yields 0.5252.

Generally, linear interpolation takes two data points, say (xa,ya) and (xb,yb), and the interpolant is
given by:

at the point (x,y)

Linear interpolation is quick and easy, but it is not very precise. Another disadvantage is that
the interpolant is not differentiable at the point xk.

The following error estimate shows that linear interpolation is not very precise. Denote the
function which we want to interpolate by g, and suppose that x lies between xa and xb and
that g is twice continuously differentiable. Then the linear interpolation error is

In words, the error is proportional to the square of the distance between the data
points. The error of some other methods, including polynomial interpolation and spline
interpolation (described below), is proportional to higher powers of the distance
between the data points. These methods also produce smoother interpolants.
Polynomial interpolation

Polynomial interpolation is a generalization of linear interpolation. Note that the linear interpolant
is a linear function. We now replace this interpolant by a polynomial of higher degree.

Consider again the problem given above. The following sixth degree polynomial goes through all
the seven points:

f(x) = − 0.0001521x6 − 0.003130x5 + 0.07321x4 − 0.3577x3 + 0.2255x2 + 0.9038x.

Substituting x = 2.5, we find that f(2.5) = 0.5965.

Generally, if we have n data points, there is exactly one polynomial of degree at most n−1
going through all the data points. The interpolation error is proportional to the distance
between the data points to the power n. Furthermore, the interpolant is a polynomial and
thus infinitely differentiable. So, we see that polynomial interpolation solves all the problems
of linear interpolation.

However, polynomial interpolation also has some disadvantages. Calculating the

interpolating polynomial is computationally expensive (seecomputational complexity)
compared to linear interpolation. Furthermore, polynomial interpolation may exhibit
oscillatory artifacts, especially at the end points (see Runge's phenomenon). These
disadvantages can be avoided by using spline interpolation or restricting
attentionChebyshev polynomials.

Extrapolation
In mathematics, extrapolation is the process of constructing new data points outside a discrete
set of known data points. It is similar to the process of interpolation, which constructs new points
between known points, but the results of extrapolations are often less meaningful, and are subject
to greater uncertainty. It may also mean extension of a method, assuming similar methods will be
applicable. Extrapolation may also apply to human experience to project, extend, or expand
known experience into an area not known or previously experienced so as to arrive at a (usually
conjectural) knowledge of the unknown (e.g. a driver extrapolates road conditions beyond his
sight while driving).

Extrapolation methods

Linear extrapolation
Linear extrapolation means creating a tangent line at the end of the known data and extending it
beyond that limit. Linear extrapolation will only provide good results when used to extend the
graph of an approximately linear function or not too far beyond the known data.

If the two data points nearest the point x * to be extrapolated are (xk − 1,yk − 1) and (xk,yk), linear
extrapolation gives the function:

(which is identical to linear interpolation if xk − 1 < x * < xk). It is possible to include more than
two points, and averaging the slope of the linear interpolant, by regression-like techniques,
on the data points chosen to be included. This is similar to linear prediction.

Polynomial extrapolation
A polynomial curve can be created through the entire known data or just near the end. The
resulting curve can then be extended beyond the end of the known data. Polynomial extrapolation
is typically done by means of Lagrange interpolation or using Newton's method of finite
differences to create a Newton series that fits the data. The resulting polynomial may be used to
extrapolate the data.

High-order polynomial extrapolation must be used with due care. For the example data set and
problem in the figure above, anything above order 1 (linear extrapolation) will possibly yield
unusable values, an error estimate of the extrapolated value will grow with the degree of the
polynomial extrapolation. This is related to Runge's phenomenon.

Conic extrapolation
A conic section can be created using five points near the end of the known data. If the conic
section created is an ellipse or circle, it will loop back and rejoin itself. A parabolic or hyperbolic
curve will not rejoin itself, but may curve back relative to the X-axis. This type of extrapolation
could be done with a conic sections template (on paper) or with a computer.

French curve extrapolation

French curve extrapolation is a method suitable for any distribution that has a tendency to be
exponential, but with accelerating or decelerating factors. This method has been used
successfully in providing forecast projections of the growth of HIV/AIDS in the UK since 1987 and
variant CJD in the UK for a number of years