logo

Spline, B-Spline in Analysis 📂Fourier Analysis

Spline, B-Spline in Analysis

Definition1

If the function f:RRf:\mathbb{R} \to \mathbb{R} is a piecewise polynomial on interval R\mathbb{R}, it is called a spline on R\mathbb{R}. The points where the polynomial changes are called knots.

Explanation

As can be seen from the definition, a spline does not have to be a continuous function. The following function ff is an example of a spline.

f(x)={0x[,0]2x2x(0,1]2xx(1,4]116x3x(4,] f(x) = \begin{cases} 0 & x\in[\infty,0] \\ 2x^{2}&x\in(0,1] \\ 2-x & x\in (1,4] \\ \frac{1}{16}x^{3} & x\in(4,\infty] \end{cases}

untitled2.png

In the above case, x=0x=0, x=1x=1, and x=4x=4 are knots. A B-spline is a spline with good properties. A BB-B-spline N1N_{1} is defined using the indicator function on interval [0,1][0,1] as follows:

N1(x):=χ[0,1](x),xR N_{1}(x) :=\chi_{[0,1]}(x)\quad , x\in \mathbb{R}

And for mNm \in \mathbb{N}, B-spline Nm+1N_{m+1} is defined as follows:

Nm+1(x):=(NmN1)(x) \begin{equation} N_{m+1}(x) := (N_{m} * N_{1})(x)\end{equation}

Here, \ast is a convolution. mm is called the order of the B-spline NmN_{m}. By definition (1)(1), the following is true:

Nm=Nm1N1=Nm2N1N1=Nm3N1N1N1=N1N1N1N1m \begin{align*} N_{m} &= N_{m-1} \ast N_{1} \\ &= N_{m-2} \ast N_{1} \ast N_{1} \\ &= N_{m-3} \ast N_{1} \ast N_{1}\ast N_{1} \\ &= \underbrace{N_{1} \ast N_{1} \ast N_{1} \cdots \ast N_{1}}_{m} \end{align*}

Also, from the definition of N1N_{1} and convolution, the following formula holds true:

Nm+1(x)=Nm(xt)N1(t)dt=01Nm(xt)dt N_{m+1}(x)=\int _{-\infty} ^{\infty}N_{m}(x-t)N_{1}(t)dt=\int_{0}^{1}N_{m}(x-t)dt

The picture below shows the graphs of N2N_{2} and N3N_{3} from left to right.2020-10-05135620.png

Properties

A B-spline of order mNm\in \mathbb{N} satisfies the following properties:

(a) suppNm=[0,m]\mathrm{supp}N_{m}=[0,m] and\text{and} Nm(x)>0 for x(0,m)N_{m}(x)>0 \text{ for } x\in(0,m)

(b) Nm(x)dx=1\displaystyle \int _{-\infty} ^{\infty} N_{m}(x)dx=1

(c) For m2m\ge 2, the following formula holds true:

kZNm(xk)=1,xR \begin{equation} \sum \limits_{k \in \mathbb{Z}} N_{m}(x-k)=1,\quad \forall x\in \mathbb{R} \end{equation}

(c’) When m=1m=1, the above formula holds true for xRZx\in \mathbb{R}\setminus \mathbb{Z}.

See Also


  1. Ole Christensen, Functions, Spaces, and Expansions: Mathematical Tools in Physics and Engineering (2010), p203-204 ↩︎