Scribd
Upload
196 views2 pages

Central Difference Interpolation

Central difference interpolation uses data points on both sides of the point being interpolated to estimate the value of the function at that point. It provides a more accurate interpolation than forward or backward difference methods alone. Some common central difference interpolation formulas include Gauss' formula, Bessel's formula, and Laplace's formula. Lagrange interpolation finds a polynomial that passes through the given data points by solving a system of linear equations. Spline interpolation uses piecewise polynomials joined at points to provide a smooth interpolation over an interval. Linear splines of order 0 simply connect the data points with straight line segments.

Uploaded by

Mengistu Abebe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
196 views2 pages

Central Difference Interpolation

Central difference interpolation uses data points on both sides of the point being interpolated to estimate the value of the function at that point. It provides a more accurate interpolation than forward or backward difference methods alone. Some common central difference interpolation formulas include Gauss' formula, Bessel's formula, and Laplace's formula. Lagrange interpolation finds a polynomial that passes through the given data points by solving a system of linear equations. Spline interpolation uses piecewise polynomials joined at points to provide a smooth interpolation over an interval. Linear splines of order 0 simply connect the data points with straight line segments.

Uploaded by

Mengistu Abebe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Central difference interpolation

newton's forward and backward interpolation formula are applicable for interpolation near the
beginning and the end of the tabulated arguments respectively.now in this lesson we discuss
interpolation near the center of tabulated arguments.for the purpose we use central difference
interpolation formula.Guass norward,Bessel's formula,laplace Euertt's formula are some of the various
central difference interpolation formulas.

Let us consif=der some equidistant arguments with interval of difference.say g and corresponding
function values are given.let xn be the central point among the arguments

For interpolation at the point x near the central value

Let f(xo)=yo,f(xo-h)=y-1,f(xo+h)=y1,

F(xo-2h)=y-2,f(x0+2h)=y2,

F(xo-3h)=y-3,f(xo+3h)=y3 and soon.

Lagrange interpolation
Let the values of the function f:[a,b]< 𝑅 → 𝑅be given at x1,x2,…..xn ∈ [a,b].choose the
function g(x)from the th set of the polynomials of degree at most (n-1)

{𝑔(𝐴, 𝑥) = 𝐴1 + 𝐴2𝑥 + 𝐴3𝑋 2 +An𝑥 𝑛−1 :A∈ 𝑅 𝑛 }

Which satisfies the condition :

G(xi)=f(xi),1,2,…..,n.

In other words, we would like to determine the coefficients A1,A2,…An such that the chosen
function g(x)to be fitted to the table.

X …. X1 X2 …. Xn
F(x) …. F(x1) F(x2) …. F(xn)
That is, the graph of g(x)to be gone through the given points ;
The simplest idea for determining coefficients is to solve the system of the linear equations.

A1+A2xi+A3𝑥𝑖 2 +…….+An𝑥 𝑛−1 =f(xi),i=1,2,3…n.

But we can obtain the result from the so-called Lagrange formula more easily. for this reason
introduce the functions
(𝑥−𝑥1)(𝑥−𝑥2)…(𝑥−𝑥𝑖−1)(𝑥−𝑥𝑖+1)…(𝑥−𝑥𝑛)
Li(x)=(𝑥𝑖−𝑥1)(𝑥𝑖−𝑥2)…(𝑥𝑖−𝑥𝑖−1)(𝑥𝑖+𝑥𝑖−1)…(𝑥𝑖−𝑥𝑛),i=1,2,…n

Spline interpolation

All Lagrange interpolation ist has been mentioned that the piecewise use of polynomials of low
degree instead of the so-called global interpolation is often advantageous.generaliging
this thought by requiring the smoothness (the existence of the derivatives of some
order)at the "connecting points”. we can obtain of the spline function.

Definition

Let the portion of the interval [a,b]be given by the points

a=x1< 𝑥2 < 𝑥3 <….xn=b

the function s:[a,b]< 𝑅 → 𝑅 is called a spline function of degree m and order k (with respect to
the given partion)if it is polynomial of degree at most m and it is continuously
defferntiable at the connecting points to the order k.

interpolation by linear spline order 0

l let the values of the function f:[a,b]< 𝑅 → 𝑅be given at a=x1< 𝑥2 < 𝑥3 < ⋯ 𝑥𝑛=b
and choosen that function (x)from the set (go'(x))of linear spines of order 0 which
satisfies the condition.

G(xi)=f(xi),i=1,2…n
1

You might also like