Natural Cubic Spline Interpolation

Cubic spline interpolation is a special case for Spline interpolation that is used very often to avoid the problem of Runge’s phenomenon. This method gives an interpolating polynomial that is smoother and has smaller error than some other interpolating polynomials such as Lagrange polynomial and Newton polynomial.

Example On Using This Code

Input

xf = [0 1 2 3];     % X Values
yf = [exp(xf(1)) exp(xf(2)) exp(xf(3)) exp(xf(4))];       % Y Values
xx = 1.5;           % Value we interest to interpolate.

Output


The numbers x(0), ..., x(n) are:
   0.0000   1.0000   2.0000   3.0000

The coefficients of the spline on the subintervals are:
    a(i)          b(i)          c(i)          d(i)
 1.00000000    1.46599761    0.00000000    0.25228421 
 2.71828183    2.22285026    0.75685264    1.69107137 
 7.38905610    8.80976965    5.83006675   -1.94335558 

Interpolated value at 1.5 is equal to = 4.2303

All Splines: 
 1.465997*conj(x) + 0.25228421*conj(x)^3 + 1.0
 5.7823590*conj(x) - 4.3163614*conj(x)^2 + 1.69107137*conj(x)^3 - 0.4387871
 17.4902*conj(x)^2 - 37.8307*conj(x) - 1.943355*conj(x)^3 + 28.6366

Definition
Boundary Conditions
Methods
Example
Exercise
References

Definition

Given a set of n + 1 data points (x_i,y_i) where no two x_i are the same and $a = x_(0) < x_(1) < \dots < x_(n) = b$ , the spline S(x) is a function satisfying:

$S(x) in C^(2) [a,b]$ ;
On each subinterval $[x_(i-1), x_(i)], S(x)$ is a polynomial of degree 3, where $i = 1,\dots ,n.$
$S(x_(i)) = y_(i),$ for all $i = 0, 1,\dots ,n.$

Let us assume that

$S(x)=\left\{{\begin{array}{rl}C_{1}(x),&x_{0}\leq x\leq x_{1}\\\cdots &\\C_{i}(x),&x_{i-1}<x\leq x_{i}\\\cdots &\\C_{n}(x),&x_{n-1}<x\leq x_{n}\end{array}}\right.$

where each

$C_{i}=a_{i}+b_{i}x+c_{i}x^{2}+d_{i}x^{3}(d_{i}\neq 0)$

is a cubic function, $i = 1,\dots ,n$ .

Boundary Conditions

To determine this cubic spline S(x), we need to determine $a_(i), b_(i), c_(i) and d_(i)$ for each i by:

$C_(i)(x_(i-1)) = y_(i-1)$ and $C_(i)(x_(i)) = y_(i)$ , $i = 1,\dots ,n.$
$C’_(i)(x_(i)) = C’_(i+1)(x_(i))$ , $i = 1,\dots ,n-1.$
$C”_(i)(x_(i)) = C”_(i+1)(x_(i))$ , $i = 1,\dots ,n-1.$

We can see that there are $n + n + (n-1) + (n-1) = 4n-2$ conditions, but we need to determine $4n$ coefficients, so usually we add two boundary conditions to solve this problem. There are three types of common boundary conditions:

I. First derivatives at the endpoints are known:

$C_{1}^{'}(x_{0})=f'_{0},{\mbox{ and }}C_{n}^{'}(x_{n})=f'_{n}$

This is called clamped boundary conditions.

II. Second derivatives at the endpoints are known:

$C_{1}^{''}(x_{0})=f_{0}^{''},{\mbox{ and }}C_{n}^{''}(x_{n})=f_{n}^{''}$ .

The special case

$C_{1}^{''}(x_{0})=C_{n}^{''}(x_{n})=0$

is called natural or simple boundary conditions.

III. When the exact function f(x) is a periodic function with period $x_(n) - x_(0)$ , S(x) is a periodic function with period $x_(n) - x_(0)$ too. Thus

$C_{1}(x_{0})=C_{n}(x_{n}),C_{1}^{'}(x_{0})=C_{n}^{'}(x_{n}),{\mbox{ and }}C_{1}^{''}(x_{0})=C_{n}^{''}(x_{n})$ .

The spline functions S(x) satisfying this type of boundary condition are called periodic splines.

Methods

There are several methods that can be used to find the spline function S(x) according to its corresponding conditions. Since there are 4n coefficients to determine with 4nconditions, we can easily plug the values we know into the 4n conditions and then solve the system of equations. Note that all the equations are linear with respect to the coefficients, so this is workable and computers can do it quite well.

The algorithm given in w:Spline interpolation is also a method by solving the system of equations to obtain the cubic function in the symmetrical form.

The other method used quite often is w:Cubic Hermite spline, this gives us the spline in w:Hermite form.

Here, we discuss another method using second derivatives $S”(x_(i)) = M_(i)(i = 0,1,\dots ,n)$ to find the expression for spline S(x).

Let $h_(i) = x_(i) - x_(i-1)$ , $i = 1,\dots ,n$ , $S”(xi) = C”_(i)(xi) = C”_(i+1) (xi) = Mi (i = 1,\dots ,n-1)$ and $S”(x0) = C”_(1)(x0) = M0, and S”(xn) = C”_(n)(xn) = Mn$ . Note that $M_{i}$ are unknown (except for type II boundary condition, $M_{0} and M_{n}$ are given).

Since each $C_(i)$ is a cubic polynomial, $C”_(i)$ is linear.

By w:Lagrange interpolation, we can interpolate each $C”_(i)$ on $[x_(i-1), x_(i)]$ since $C”_(i)(x_(i-1)) = M_(i-1)$ and $C”_(i)(xi) = Mi$ , the Lagrange form of this interpolating polynomial is:

$C''_{i}(x)=M_{i-1}{\frac {x_{i}-x}{h_{i}}}+M_{i}{\frac {x-x_{i-1}}{h_{i}}}$ for $x in [x_{i-1},x_{i}]$ .

Integrating the above equation twice and using the condition that $C_{i}(x_{i-1}) = y_{i-1}$ and $C_{i}(x_{i}) = y_{i}$ to determine the constants of integration, we have

C_{i}(x)=M_{i-1}{\frac {(x_{i}-x)^{3}}{6h_{i}}}+M_{i}{\frac {(x-x_{i-1})^{3}}{6h_{i}}}+\left(y_{i-1}-{\frac {M_{i-1}h_{i}^{2}}{6}}\right){\frac {x_{i}-x}{h_{i}}}+\left(y_{i}-{\frac {M_{i}h_{i}^{2}}{6}}\right){\frac {x-x_{i-1}}{h_{i}}}\quad {\text{for}}\quad x\in [x_{i-1},x_{i}].

(1)

This expression gives us the cubic spline S(x) if $M_{i},i=0,1,…. ,n$ can be determined.

For $i=1,\dots ,n-1$ when $x in [x_{i}, x_{i+1}]$ , we can calculate that

$C'_{i+1}(x)=-M_{i}{\frac {(x_{i+1}-x)^{2}}{2h_{i+1}}}+M_{i+1}{\frac {(x-x_{i})^{2}}{2h_{i+1}}}+{\frac {y_{i+1}-y_{i}}{h_{i+1}}}-{\frac {M_{i+1}-M_{i}}{6}}h_{i+1}.$

Therefore,

$C'_{i+1}(x_{i})=-M_{i}{\frac {h_{i+1}}{2}}+{\frac {y_{i+1}-y_{i}}{h_{i+1}}}-{\frac {M_{i+1}-M_{i}}{6}}h_{i+1}.$

Similarly, when $x in [x_{i-1}, x_{i}]$ , we can shift the index to obtain

C'_{i}(x)=-M_{i-1}{\frac {(x_{i}-x)^{2}}{2h_{i}}}+M_{i}{\frac {(x-x_{i-1})^{2}}{2h_{i}}}+{\frac {y_{i}-y_{i-1}}{h_{i}}}-{\frac {M_{i}-M_{i-1}}{6}}h_{i}.

(2)

Thus,

$C'_{i}(x_{i})=M_{i}{\frac {h_{i}}{2}}+{\frac {y_{i}-y_{i-1}}{h_{i}}}-{\frac {M_{i}-M_{i-1}}{6}}h_{i}.$

Since

$C'_{i+1}(x_{i})=C'_{i}(x_{i})$ , we can derive

\mu _{i}M_{i-1}+2M_{i}+\lambda _{i}M_{i+1}=d_{i}\quad {\text{for}}\quad i=1,2,\cdots ,n-1,

(3)

where

\mu _{i}={\frac {h_{i}}{h_{i}+h_{i+1}}},\quad \lambda _{i}=1-\mu _{i}={\frac {h_{i+1}}{h_{i}+h_{i+1}}},\quad {\text{and}}\quad d_{i}=6f[x_{i-1},x_{i},x_{i+1}]\,

(4)

and $f[x_{i-1}, x_{i} ,x_{i+1}]$ is a divided difference. According to different boundary conditions, we can solve the system of equations above to obtain the values of $M_{i}$ ‘s.

I. For type I boundary condition, we are given $C’_{1}(x_{0}) = f’_{0}$ and $C’_{n}(x_{n}) = f’_{n}$ . According to equation (2 ), we can obtain

C'_{1}(x_{0})=-M_{0}{\frac {(x_{1}-x_{0})^{2}}{2h_{1}}}+M_{1}{\frac {(x_{0}-x_{0})^{2}}{2h_{1}}}+{\frac {y_{1}-y_{0}}{h_{1}}}-{\frac {M_{1}-M_{0}}{6}}h_{1}.

\Rightarrow f'_{0}=-M_{0}{\frac {h_{1}}{2}}+f[x_{0},x_{1}]-{\frac {M_{1}-M_{0}}{6}}h_{1}

\Rightarrow 2M_{0}+M_{1}={\frac {6}{h_{1}}}(f[x_{0},x_{1}]-f'_{0})=6f[x_{0},x_{0},x_{1}]

(5.1)

Similarly, simplifying

C'_{n}(x_{n})=-M_{n-1}{\frac {(x_{n}-x_{n})^{2}}{2h_{n}}}+M_{n}{\frac {(x_{n}-x_{n-1})^{2}}{2h_{n}}}+{\frac {y_{n}-y_{n-1}}{h_{n}}}-{\frac {M_{n}-M_{n-1}}{6}}h_{n}

we will have

M_{n-1}+2M_{n}={\frac {6}{h_{n}}}(f'_{n}-f[x_{n-1},x_{n}])=6f[x_{n-1},x_{n},x_{n}]

(5.2)

Therefore, let

$\lambda _{0}=\mu _{n}=1,d_{0}=6f[x_{0},x_{0},x_{1}]$

and

$d_{n}=6f[x_{n-1},x_{n},x_{n}]$

, combine (3 ), (5.1 ) and (5.2 ) together, so the system of equations that we need to solve is

\left[{\begin{array}{ccccccc}2&\lambda _{0}&&&&&\\\mu _{1}&2&\lambda _{1}&&&&\\&\ddots &\ddots &\ddots &&&\\&&\ddots &\ddots &\ddots &&\\&&&\ddots &\ddots &\ddots &\\&&&&\mu _{n-1}&2&\lambda _{n-1}\\&&&&&\mu _{n}&2\end{array}}\right]\left[{\begin{array}{c}M_{0}\\M_{1}\\\vdots \\\vdots \\\vdots \\M_{n-1}\\M_{n}\end{array}}\right]=\left[{\begin{array}{c}d_{0}\\d_{1}\\\vdots \\\vdots \\\vdots \\d_{n-1}\\d_{n}\end{array}}\right].

(6)

II. For type II boundary condition, we are given

M_{0}=f''_{0}

and

$M_{n}=f''_{n}$

(7)

directly, so let $lambda _{0} = mu _{n} = 0$ , $d_{0} = 2f”_{0}$ , and $d_{n} = 2f”_{n}$ , and we need to solve the system of equations in the same form as (6).

Example

For points (0,0), (1,0.5), (2,2) and (3,1.5), find the interpolating cubic spline $S(x)$ satisfying $S'(0) = 0.2$ and $S'(3) = -1$ .

Solution:

We can easily see that $h_{i} = 1$ for $i = 1,2,3$ so

$\lambda _{0}=1,\lambda _{1}=\lambda _{2}=\mu _{1}=\mu _{2}={\frac {1}{2}}$

and $mu _{3} = 1.$

Also, since this is the type I boundary condition problem, we can calculate that

f[x_{0},x_{1},x_{0}]=f[x_{0},x_{0},x_{1}]=(f[x_{1},x_{0}]-f[x_{0},x_{0}])/(x_{1}-x_{0})=\left({\frac {0.5-0}{1-0}}-0.2\right)/1=0.3;

f[x_{0},x_{1},x_{2}]=f[x_{0},x_{1},x_{2}]=(f[x_{2},x_{1}]-f[x_{1},x_{0}])/(x_{2}-x_{0})=\left({\frac {2-0.5}{2-1}}-{\frac {0.5-0}{1-0}}\right)/2=0.5;

f[x_{1},x_{2},x_{3}]=f[x_{1},x_{2},x_{3}]=(f[x_{3},x_{2}]-f[x_{2},x_{1}])/(x_{3}-x_{1})=\left({\frac {1.5-2}{3-2}}-{\frac {2-0.5}{2-1}}\right)/2=-1;

and

f[x_{3},x_{2},x_{3}]=f[x_{2},x_{3},x_{3}]=(f[x_{3},x_{3}]-f[x_{2},x_{3}])/(x_{3}-x_{2})=\left(-1-{\frac {1.5-2}{3-2}}\right)/1=-{\frac {1}{2}}.

Therefore, plug into the system of equations, we have

$\left[{\begin{array}{cccc}2&1&&\\1/2&2&1/2&\\&1/2&2&1/2\\&&1&2\end{array}}\right]\left[{\begin{array}{c}M_{0}\\M_{1}\\M_{2}\\M_{3}\end{array}}\right]=\left[{\begin{array}{c}6\times 0.3\\6\times 0.5\\6\times (-1)\\6\times (-1/2)\end{array}}\right].$

The solution is $M_{0} = -0.36, M_{1} = 2.52, M_{2} = -3.72$ and $M_{3}=0.36.$

Therefore, by the general expression of the solution, we have

${\begin{aligned}C_{1}(x)&=M_{0}{\frac {(x_{1}-x)^{3}}{6}}+M_{1}{\frac {(x-x_{0})^{3}}{6}}+(y_{0}-{\frac {M_{0}}{6}}){\frac {x_{1}-x}{1}}+(y_{1}-{\frac {M_{1}}{6}}){\frac {x-x_{0}}{1}}\\&=-0.36{\frac {(1-x)^{3}}{6}}+2.52{\frac {x^{3}}{6}}+{\frac {0.36}{6}}(1-x)+(0.5-{\frac {2.52}{6}})x\\&=0.06(x-1)^{3}+0.42x^{3}+0.06(1-x)+0.08x\\&=0.48x^{3}-0.18x^{2}+0.2x\,.\end{aligned}}$

Similarly,

C_{2}(x)=-1.04(x-1)^{3}+1.26(x-1)^{2}+1.28(x-1)+0.5,

C_{3}(x)=0.68(x-2)^{3}-1.86(x-2)^{2}+0.68(x-2)+2.

Thus the cubic spline is

$S(x)=\left\{{\begin{array}{rl}0.48x^{3}-0.18x^{2}+0.2x,&0\leq x\leq 1\\-1.04(x-1)^{3}+1.26(x-1)^{2}+1.28(x-1)+0.5,&1<x\leq 2\\0.68(x-2)^{3}-1.86(x-2)^{2}+0.68(x-2)+2,&2<x\leq 3\end{array}}\right.$

References

Polynomial and Spline Interpolation, http://www.math.ohiou.edu/courses/math3600/lecture19.pdf
数值分析，李庆扬，王能超，易大易，2001. ISBN 7-302-04561-5 (Numerical Analysis, Qinyang Li, Nengchao Wang, Dayi yi.)

1 Sale

Share Now!

Natural Cubic Spline Interpolation

Example On Using This Code

Input

Output

Contents

Definition

Boundary Conditions

Methods

Example

References

Download Details

$4.99

Release Information

Subscribe

Product Tags

Recent Blog Posts

LSB Based Image Steganography Us...

RGB Image to Grayscale Image Con...

Resize an Image in Matlab

Servo Motor Control using MATLAB

GUI Based Home Automation System...

Related Products

Householder’s Root Finding Method of Linear and Nonlinear Equations

Legendre collocation Matlab Code for Solving Volterra–Fredholm Integral Equations

Standard Atmosphere Calculator

Popular & Trending

Newtons Interpolating Polynomials Method

Durand-Kener For Computing All the Roots of a Polynomial in Any Order

Climb Flight Performance Characteristics For Jet and Propeller Aircrafts

Featured Products

Matlab Aircraft Intuitive Design and Analysis Program AID

Covert Speech to Text in MATLAB

Analyzing N Order Spring-Mass Oscillator System using Gauss Seidel

Share Your Valuable Opinions Cancel Reply

27717

Subscribe

Natural Cubic Spline Interpolation

Choose Your Desired Option(s)

Example On Using This Code

Input

Output

Contents

Definition

Boundary Conditions

Methods

Example

References

Download Details

$4.99

Release Information

Subscribe

Product Tags

Recent Blog Posts

Related Products

Popular & Trending

Featured Products

Share Your Valuable Opinions Cancel Reply