Applied Mathematics and Computation 263 (2015) 353–360

Contents lists available at ScienceDirect

Applied Mathematics and Computation

journal homepage: www.elsevier.com/locate/amc

Quintic B-spline method for integro interpolation

Feng-Gong Lang∗, Xiao-Ping Xu
School of Mathematical Sciences, Ocean University of China, Qingdao, Shandong 266100, People’s Republic of China

a r t i c l e i n f o a b s t r a c t

Keywords: In this paper, we study a new method for integro interpolation. Our interpolation method is
Integro interpolation based on quintic B-splines and easy to be implemented. The interpolation errors are studied.
Quintic B-spline
Numerical results illustrate our method is very effective.
Integral value
© 2015 Published by Elsevier Inc.

1. Introduction

In the traditional interpolation problems of numerical analysis, we are often given the function values yj = y(xj ) of an unknown
univariate real-valued function y(x) over a set of distinct knots over an interval [a, b]. The given function values are used to get
an interpolating function p(x) such that

p(xj ) = yj = y(xj ), ( j = 0, 1, . . . , n).

In this paper, we assume the function values at the knots are not given, but the integral values Ij of the function y(x) on the
subintervals [xj , xj+1 ]( j = 0, 1, . . . , n − 1) are known. Our task is to determine an integro-interpolating function p(x) to agree with
the given integral values Ij , that is
 xj+1  xj+1
p(x)dx = Ij = y(x)dx, ( j = 0, 1, . . . , n − 1). (1)
xj xj

Generally, it is called integro interpolation. It has many practical applications in the fields of numerical analysis, mathematical
statistics, environmental science, mechanics, electricity, climatology, oceanography and so on, see [1–8].
Currently, there have been only a few research papers on integro interpolation, see [5–8]. However, these methods have many
drawbacks. The quartic spline method in [5] is very complicated. It needs to solve a linear system with 2n + 2 equations actually.
The error orders of the cubic spline methods in [6,7] are lower and reported to be only O(h4 ). The quintic spline method in [8]
is also very complicated by using the so-called “quintic Hermite–Birkhoff polynomials”. It needs to solve three linear systems
 
by using seven additional boundary conditions (y(x0 ), y (x0 ), y (x1 ), y (xn − 1 ), y (xn ), y  (x0 ) and y  (xn )). Here, we point that
the strategy in [8] is not proper. We know the dimension of the quintic spline space over [x0 , xn ] is n + 5. Since (1) gives us n
equations, hence, we need and only need another five (not seven) independent boundary conditions. In practical applications,
the two redundant boundary conditions in [8] will result a contradiction. Another shortcoming of [5,6,8] is they have not studied
the derivatives approximation.
In this paper, we study a new technique for integro interpolation. By using quintic B-splines, we get a simple linear system
with n + 5 equations, where the coefficient matrix is a six-band matrix. Hence, it is very easy to be implemented. We use y(x0 ),

∗
Corresponding author. Tel.:+8653266787153.
E-mail address: langfg@aliyun.com, langfg@yahoo.cn (F.-G. Lang).

http://dx.doi.org/10.1016/j.amc.2015.04.076
0096-3003/© 2015 Published by Elsevier Inc.
354 F.-G. Lang, X.-P. Xu / Applied Mathematics and Computation 263 (2015) 353–360

Table 1
The values of B(i k)(x)(i = −2, −1, . . . , n + 2; k = 0, 1, 2, 3, 4) at the knots.

xi − 3 xi − 2 xi − 1 xi xi + 1 xi + 2 xi + 3 else

1 26 66 26 1
Bi (x) 0 120 120 120 120 120
0 0
Bi (x) 0 1
24h
10
24h
0 10
− 24h 1
− 24h 0 0
Bi (x) 0 1
6h2
2
6h2
− 6h62 2
6h2
1
6h2
0 0
B(i 3)(x) 0 1
2h3
− 2h23 0 2
2h3
− 2h13 0 0
B(i 4)(x) 0 1
h4
− h44 6
h4
− h44 1
h4
0 0

y(x1 ), y(x2 ), y(xn − 1 ) and y(xn ) as boundary conditions. Our integro-interpolating quintic spline s(x) is able to approximate y(x)
with O(h6 ) errors. Furthermore, it can also approximate the derivatives. We prove that

y(k)(x) − s(k)(x) = O(h6−k ), k = 0, 1, 2, 3, 4.

These results are similar to that of the ordinary quintic spline interpolation problem.
The remainder of this paper is organized as follows. Section 2 presents some preliminary results of quintic B-splines;
Section 3 gives the new quintic B-spline method for integro interpolation; Section 4 analyzes the interpolation errors for
the new method; Section 5 is devoted to numerical tests, numerical results show that our method is very effective not only in
function approximation but also in derivatives approximation; finally, we conclude our paper in Section 6.

2. Preliminaries

For an interval I = [a, b], divide it into n subintervals by the equidistant knots xi = a + ih, where i = [xi , xi+1 ](i = 0, 1, . . . , n − 1)
and h = b−a
n . The univariate quintic spline space over the uniform partition is defined as follows:

S5 (I) = {s(x) ∈ C 4 (I)|si (x) ∈ P5 , i = 0, 1, . . . , n − 1},

where si (x) denotes the restriction of s(x) over i = [xi , xi + 1 ], and P5 denotes the set of univariate quintic polynomials. S5 (I)
is a linear space of dimension n + 5. Essentially, a quintic spline s(x) is a piecewise quintic polynomial such that s(x), s (x),

s (x), s  (x) and s(4) (x) are continuous on [a, b]. Extend I = [a, b] to 
I = [a − 5h, b + 5h] with the equidistant knots xi = a + ih(i =
−5, −3, . . . , n + 5). By the results in [9–13], we obtain the explicit representations of the typical quintic B-spline Bi (x)(i = −2, −1,
. . . , n + 2) as follows
⎧
⎪
⎪(x − xi + 3h)5 , if x ∈ [xi−3 , xi−2 ]
⎪
⎪(x − xi + 3h)5 − 6(x − xi + 2h)5 , if x ∈ [xi−2 , xi−1 ]
⎪
⎪
⎪
⎪(x − xi + 3h)5 − 6(x − xi + 2h)5 + 15(x − xi + h)5 ,
⎨ if x ∈ [xi−1 , xi ]
1
Bi (x) = (−x + xi + 3h)5 − 6(−x + xi + 2h)5 + 15(−x + xi + h)5 , if x ∈ [xi , xi+1 ] .
120h5 ⎪
⎪
⎪(−x + xi + 3h) − 6(−x + xi + 2h) ,
⎪ if x ∈ [xi+1 , xi+2 ]
5 5
⎪
⎪
⎪
⎪
⎩
(−x + xi + 3h) ,5
if x ∈ [xi+2 , xi+3 ]
0, else
We list some properties of Bi (x) as follows

• Bi (x)(i = −2, −1, . . . , n + 2) are linearly independent, they are the basis splines of S5 (I);
• B(i k)(x) = B(i+1
k)
(x + h)(i = −2, −1, . . . , n + 1; k = 0, 1, 2, 3, 4), the values of B(i k)(x) at the knots are given in Table 1;

n+2
• Bi (x) ≡ 1(x ∈ [a, b]);
i=−2
• Bi (x)(i = −2, −1, . . . , n + 2) is non-negative and is locally supported on [xi − 3 , xi + 3 ], moreover, we have
 xi−2  xi+3
1
Bi (x)dx = Bi (x)dx = h, (2)
xi−3 xi+2 720

 xi−1  xi+2
57
Bi (x)dx = Bi (x)dx = h, (3)
xi−2 xi+1 720

 xi  xi+1
302
Bi (x)dx = Bi (x)dx = h, (4)
xi−1 xi 720

 xj+1
Bi (x)dx = 0, ( j ≥ i + 3, or j ≤ i − 4). (5)
xj
 F.-G. Lang, X.-P. Xu / Applied Mathematics and Computation 263 (2015) 353–360 355

3. Quintic B-spline method for integro interpolation

The integro quintic spline interpolation problem is stated as follows. Let n  4, given the integral values Ij of y(x) on
[xj , xj+1 ]( j = 0, 1, . . . , n − 1), and five boundary function values y0 = y(x0 ), y1 = y(x1 ), y2 = y(x2 ), yn − 1 = y(xn − 1 ) and yn = y(xn ),
construct a quintic spline s(x)  S5 (I) such that
 xj+1  xj+1
s(x)dx = Ij = y(x)dx, ( j = 0, 1, . . . n − 1), (6)
xj xj

and

s(x0 ) = y0 , s(x1 ) = y1 , s(x2 ) = y2 , s(xn−1 ) = yn−1 , s(xn ) = yn . (7)

In this section, we give our new method for the problem. Our method is very easy and effective than the method in [8].

The integro-interpolating quintic spline s(x) is an element in S5 (I), hence, it can be represented as s(x) = n+2
i=−2 ci Bi (x). For
j = 0, 1, . . . , n − 1, by (6), using (2)–(5), we have
 xj+1  xj+1
n+2  xj+1
j+3
s(x)dx = ci Bi (x)dx = ci Bi (x)dx
xj xj xj
i=−2 i=j−2

j+3  xj+1
= ci Bi (x)dx = Ij .
xj
i=j−2

That is

h
(cj−2 + 57cj−1 + 302cj + 302cj+1 + 57cj+2 + cj+3 ) = Ij . (8)
720
Moreover, the five boundary conditions give us five equations
⎧ ⎧
⎨s(x0 ) = y0 ⎨c−2 + 26c−1 + 66c0 + 26c1 + c2 = 120y0
s(x1 ) = y1 ⇒ c−1 + 26c0 + 66c1 + 26c2 + c3 = 120y1 (9)
⎩ ⎩
s(x2 ) = y2 c0 + 26c1 + 66c2 + 26c3 + c4 = 120y2 ,
and

s(xn−1 ) = yn−1 , c + 26cn−2 + 66cn−1 + 26cn + cn+1 = 120yn−1

⇒ n−3 (10)
s(xn ) = yn cn−2 + 26cn−1 + 66cn + 26cn+1 + cn+2 = 120yn .
Thus, (9), (8) and (10) give us a linear system with ci (i = −2, −1, . . . , n + 2) as unknowns. We note the system as

AC = F, (11)

where
⎛ ⎞
1 26 66 26 1 0 0
⎜0 1 26 66 26 1 0 ⎟
⎜ ⎟
⎜0 0 1 26 66 26 1 ⎟
⎜ ⎟
⎜1 57 302 302 57 1 ⎟
⎜ ⎟
⎜ 1 57 302 302 57 1 ⎟
⎜ ⎟
A=⎜
⎜ .. .. .. .. .. .. ⎟
⎟ , (12)
⎜ . . . . . . ⎟
⎜ ⎟
⎜ 1 57 302 302 57 1 ⎟
⎜ ⎟
⎜ 1 57 302 302 57 1⎟
⎜ ⎟
⎝ 1 26 66 26 1 0⎠
0 1 26 66 26 1 (n+5)×(n+5)

and

C = (c−2 , c−1 , c0 , c1 , . . . , cn+1 , cn+2 )T ,

 T
720 720
F = 120y0 , 120y1 , 120y2 , I0 , . . . , In−1 , 120yn−1 , 120yn .
h h
n+2
After solving the system (11), we obtain the integro-interpolating quintic spline s(x) = i=−2 ci Bi (x). We can use s(k)(x) =
n+2 (k)
i=−2 ci Bi (x) to approximate y(k) (x)(k = 0, 1, 2, 3, 4). Especially, at the knots xj ( j = 0, 1, . . . , n), by using the data in Table 1, we
356 F.-G. Lang, X.-P. Xu / Applied Mathematics and Computation 263 (2015) 353–360

have the following formulae

n+2
1
sj = s(xj ) = ci Bi (xj ) = (cj−2 + 26cj−1 + 66cj + 26cj+1 + cj+2 ), (13)
120
i=−2

n+2
1
mj = s (xj ) = ci Bi (xj ) = (−cj−2 − 10cj−1 + 10cj+1 + cj+2 ), (14)
24h
i=−2

n+2
1
Mj = s (xj ) = ci Bi (xj ) = (cj−2 + 2cj−1 − 6cj + 2cj+1 + cj+2 ), (15)
6h2
i=−2

n+2
1
Tj = s(3)(xj ) = ci B(i 3)(xj ) = (−cj−2 + 2cj−1 − 2cj+1 + cj+2 ), (16)
2h3
i=−2

n+2
1
Fj = s(4)(xj ) = ci B(i 4)(xj ) = (cj−2 − 4cj−1 + 6cj − 4cj+1 + cj+2 ); (17)
h4
i=−2

which are used to approximate y(k) (xj ) (k = 0, 1, 2, 3, 4).

4. Error analysis

In order to analyze the errors, we give some useful operators (see [10,14–18]). For a given step h and an infinitely differentiable
y(x), we define
Ey(x) = y(x + h), Dy(x) = y (x) and Iy(x) = y(x)
Further, for a positive integer m, we have
Em y(x) = y(x + mh), E−m y(x) = y(x − mh),
D y(x) = y(m)(x),
m
I y(x) = y(x).
m

Moreover, we have
∞
∞ 
hi y(i)(x) (hD)i
Ey(x) = y(x + h) = = y(x) = ehD y(x),
i! i!
i=0 i=0

we note E = ehD .
Similarly, we have
E−1 = e−hD , Em = emhD and E−m = e−mhD .

Lemma 4.1. For j = 0, 1, . . . , n, let yj = y(xj ) for short, we have

E−I
Ij = yj . (18)
D
Proof. Using the Taylor formula, we have
  ∞
xj+1
xj+1
y(i)(xj )
Ij = y(x)dx = (x − xj )i dx
xj xj i!
i=0
∞
h i+1
ehD − I
= y(i)(xj ) = y(xj )
i=0
(i + 1)! D
E−I
= yj .
D


Lemma 4.2. Let s(x) be the integro-interpolating quintic spline obtained by (6) and (7) for y(x). For j = 0, 1, . . . , n, we have
 
6 E−2 + 26E−1 + 66I + 26E + E2
sj = Ij , (19)
E−2 + 57E−1 + 302I + 302E + 57E2 + E3
h
 
30 −E−2 − 10E−1 + 10E + E2
mj = 2 Ij , (20)
h E−2 + 57E−1 + 302I + 302E + 57E2 + E3
 
120 E−2 + 2E−1 − 6I + 2E + E2
Mj = 3 Ij , (21)
h E−2 + 57E−1 + 302I + 302E + 57E2 + E3
 F.-G. Lang, X.-P. Xu / Applied Mathematics and Computation 263 (2015) 353–360 357

 
360 −E−2 + 2E−1 − 2E + E2
Tj = Ij , (22)
h4 E−2 + 57E−1 + 302I + 302E + 57E2 + E3
 
720 E−2 − 4E−1 + 6I − 4E + E2
Fj = Ij , (23)
h5 E + 57E−1 + 302I + 302E + 57E2 + E3
−2

where sj , mj , Mj , Tj and Fj are given by (13)–(17).

Proof. By using (8) and (13), we have

h
(sj−2 + 57sj−1 + 302sj + 302sj+1 + 57sj+2 + sj+3 ) = Ij−2 + 26Ij−1 + 66Ij + 26Ij+1 + Ij+2 .
6
Using operator notations, we have
h −2
(E + 57E−1 + 302I + 302E + 57E2 + E3 )sj = (E−2 + 26E−1 + 66I + 26E + E2 )Ij .
6
So (19) is obtained. Similarly, using (8) and (14)–(17), we have
h2
(mj−2 + 57mj−1 + 302mj + 302mj+1 + 57mj+2 + mj+3 ) = −Ij−2 − 10Ij−1 + 10Ij+1 + Ij+2 ,
30

h3
(Mj−2 + 57Mj−1 + 302Mj + 302Mj+1 + 57Mj+2 + Mj+3 ) = Ij−2 + 2Ij−1 − 6Ij + 2Ij+1+ + Ij+2 ,
120

h4
(Tj−2 + 57Tj−1 + 302Tj + 302Tj+1 + 57Tj+2 + Tj+3 ) = −Ij−2 + 2Ij−1 − 2Ij+1 + Ij+2 ,
360

h5
(Fj−2 + 57Fj−1 + 302Fj + 302Fj+1 + 57Fj+2 + Fj+3 ) = Ij−2 − 4Ij−1 + 6Ij − 4Ij+1 + Ij+2 ,
720
Hence, (20)–(23) are obtained. 

Lemma 4.3. By Lemmas 4.1 and 4.2, we have

 
−E−2 − 25E−1 − 40I + 40E + 25E2 + E3
6
sj = yj , (24)
E−2 + 57E−1 + 302I + 302E + 57E2 + E3
hD
 
30 E−2 + 9E−1 − 10I − 10E + 9E2 + E3
mj = 2 yj , (25)
h D E−2 + 57E−1 + 302I + 302E + 57E2 + E3
 
120 −E−2 − E−1 + 8I − 8E + E2 + E3
Mj = yj , (26)
h3 D E−2 + 57E−1 + 302I + 302E + 57E2 + E3
 
360 E−2 − 3E−1 + 2I + 2E − 3E2 + E3
Tj = yj , (27)
h4 D E−2 + 57E−1 + 302I + 302E + 57E2 + E3
 
720 −E−2 + 5E−1 − 10I + 10E − 5E2 + E3
Fj = yj . (28)
h5 D E + 57E−1 + 302I + 302E + 57E2 + E3
−2

Proof. The proof is omitted. 

Theorem 4.1. For j = 0, 1, . . . , n, we have

1
sj = y(xj ) − h6 y(6)(xj ) + O(h7 ), (29)
5040

1
mj = y (xj ) + h6 y(7)(xj ) + O(h7 ), (30)
6048

19 4 (6)
Mj = y (xj ) − h y (xj ) + O(h5 ), (31)
720

1 4 (7)
Tj = y (xj ) − h y (xj ) + O(h5 ). (32)
240

1 2 (6)
Fj = y(4)(xj ) − h y (xj ) + O(h3 ). (33)
12
358 F.-G. Lang, X.-P. Xu / Applied Mathematics and Computation 263 (2015) 353–360

Proof. Let u = hD, by (24), we have

  137 6
6 −e−2u − 25e−u − 40 + 40eu + 25e2u + e3u 720 + 360u + 300u2 + 120u3 + 57u4 + 19u5 + 21
u + ···
=
u e−2u + 57e−u + 302 + 302eu + 57e2u + e3u 720 + 360u + 300u2 + 120u3 + 57u4 + 19u5 + 20
3
u 6 + ···

137
− 20
213
= 1+ u6 + · · ·
720
1
= 1− u6 + · · · ,
5040
Hence,
 
(hD)6 1
sj = I − + · · · yj = y(xj ) − h6 y(6)(xj ) + O(h7 ),
5040 5040
(29) is proved. By similar manners, let u = hD, by (28), we have
 
720 −e−2u + 5e−u − 10 + 10eu − 5e2u + e3u u4 720 + 360u + 240u2 + · · ·
−2u
=
h4 u e + 57e−u + 302 + 302eu + 57e2u + e3u h4 720 + 360u + 300u2 + · · ·
 
u4 240 − 300 2
= 4 1+ u + ···
h 720
4  
u 1 2
= 4 1− u + ··· ,
h 12
hence, we have
 
(hD)2 1 2 (6)
Fj = D4 I − + · · · yj = y(4)(xj ) − h y (xj ) + O(h3 ),
12 12
(33) is proved. We omit the proof of (30)–(32). 

Theorem 4.1 gives the errors at the knots. For the global approximation errors, we give the next theorem.

Theorem 4.2. Let y(x) be a function of class C [a, b], s(x) be the integro-interpolating quintic spline obtained by (6) and (7), then we
have

y(k)(x) − s(k)(x)∞ = O(h6−k ), k = 0, 1, 2, 3, 4,

where  · ∞ = max | · |.
a≤x≤b

Proof. Firstly, we prove y(4) (x) − s(4) (x) = O(h2 ). Since s(x) is a quintic spline, hence s(4) (x) is a piecewise continuous linear
function over [a, b] with respect to the partition. For j = 1, 2, . . . , n, let s(j 4)(x) denotes the restriction of s(4) (x) over [xj − 1 , xj ], and
we have
xj − x x − xj−1
s(j 4)(x) = s(4)(x)|[xj−1 ,xj ] = Fj−1 + Fj . (34)
h h
We define another piecewise continuous linear function y
(4)(x) by

 xj − x x − xj−1
y(j 4)(x) = y
(4)(x)| (4)
[xj−1 ,xj ] = y (xj−1 ) + y(4)(xj ) . (35)
h h
Obviously y
(4)(x) is the piecewise linear interpolating function to y(4) (x). By the basic interpolation theory ([19–21]), we have

y(4)(x) − y
(4)(x) = O(h2 ).
∞ (36)

By (33)–(35), we have

max |s(j 4)(x) − y

(4)
j
(x)| = O(h2 ).
xj−1 ≤x≤xj

So

s(4)(x) − y
(4)(x) = O(h2 ).
∞ (37)

By (36) and (37), we have

s(4)(x) − y(4)(x)∞ ≤ y(4)(x) − y ∞


(4)(x) + s(4)(x) − y (4)(x) = O(h2 ).
∞ (38)
  
Next, we prove y  (x)
− s  (x)
= O(h3 ).
Similarly, for j = 1, 2, . . . , n, let s
j
(x) denotes the restriction of s  (x) over [xj − 1 , xj ].
By using (32) and (38), for x  [xj − 1 , xj ], we have
 F.-G. Lang, X.-P. Xu / Applied Mathematics and Computation 263 (2015) 353–360 359

Table 2
The maximum absolute errors of s1 (x) for y1 (x) = 100x5 .
  
n E(n) E (n) E (n) E (n) E(4) (n)

10 5.304 × 10−14 1.432 × 10−11 9.431 × 10−10 3.673 × 10−8 8.520 × 10−7

Table 3
The maximum absolute errors of s2 (x) for y2 (x) = ex .
  
n E(n) E (n) E (n) E (n) E(4) (n)

10 1.224 × 10−10 3.667 × 10−8 3.291 × 10−6 1.234 × 10−4 2.398 × 10−3
20 2.022 × 10−12 1.152 × 10−9 2.074 × 10−7 1.559 × 10−5 6.248 × 10−4
40 5.684 × 10−14 5.807 × 10−11 2.065 × 10−8 3.380 × 10−6 1.957 × 10−4

Table 4
The maximum absolute errors of s3 (x) for y3 (x) = sin (π x).
  
n E(n) E (n) E (n) E (n) E(4) (n)

25 1.794 × 10−10 2.608 × 10−8 6.476 × 10−6 7.721 × 10−4 1.303 × 10−1
50 2.415 × 10−12 4.057 × 10−10 2.232 × 10−7 4.802 × 10−5 3.233 × 10−2
100 5.440 × 10−14 9.509 × 10−12 1.421 × 10−8 4.749 × 10−6 8.110 × 10−3

   
x x
(4)
s
j (x) − y (x) =

sj (t)dt + Tj−1 − y(4)(t)dt + y (x j−1 )
xj−1 xj−1
 x
= (s(j 4)(t) − y(4)(t))dt + (Tj−1 − y (xj−1 ))
xj−1

= O(h3 ) + O(h4 ) = O(h3 ),

 
so y  (x) − s  (x) = O(h3 ) holds. By similar manners, integrating s
j
(t) − y (t), sj (t) − y (t) and sj (t) − y (t), and taking the
infinite norm step by step, we get y (x) − s (x) = O(h4 ), y (x) − s (x) = O(h5 ) and y(x) − s(x) = O(h6 ). 

5. Numerical tests and discussions

To test the accuracy and efficiency of our new method, we perform some numerical tests by Matlab. The numerical results
show that our method is very effective.
The tested functions are y1 (x) = 100x5 , y2 (x) = ex and y3 (x) = sin (π x), the interval [a, b] = [0, 1]. Let s1 (x), s2 (x) and s3 (x) be
the quintic integro-interpolating splines by (6) and (7) for y1 (x), y2 (x) and y3 (x). The respective maximum absolute errors are
given in Tables 2–4, where

E(n) = max |yj − sj |

0≤j≤n

1
= max |y(xj ) − (cj−2 + 26cj−1 + 66cj + 26cj+1 + 26cj+2 )|,
0≤j≤n 120

and E (n), E (n), E  (n), E(4) (n) are defined similarly by using (14)–(17).
Since y1 (x) = 100x5 is a quintic polynomial, hence, its quintic integro-interpolating spline is itself, i.e. s1 (x) = 100x5 also.
Theoretically, the errors in Table 2 should be zeroes, here, the slight increase is due to the unavoidable round-off errors. In fact,
our method reproduces the univariate polynomials of degree  5.
1
From Tables 3 and 4, it is easy to observe that E(n) decrease by about 64 when the original interval is refined by half step

by step. This shows that E(n) = O(h6 ). Similarly, the decrease rates of E (n), E (n), E  (n) and E(4) (n) are about 32
1 1
, 16 , 18 and 14
respectively, when the interval is refined. The decrease rates are consistent with the theoretical results in Section 4.
For the sake of comparison, we take y2 (x) = ex as an example, which has also been approximated in [6–8]. By referring to
these papers, we find our new results in Table 3 are better than their numerical results. We remark that the new quintic B-spline
method has higher approximation ability.

6. Conclusions

In this paper, we mainly study a new quintic B-spline method for integro interpolation. Our method is very concise and easy
to be applied. The quintic integro-interpolating spline is able to approximate the original function and its first, second, third,
fourth order derivatives values with higher accuracy.
360 F.-G. Lang, X.-P. Xu / Applied Mathematics and Computation 263 (2015) 353–360

Acknowledgments

This work was supported by the National Natural Science Foundation of China (no.11071228) and the Fundamental Research
Funds for the Central Universities (no.201113037). We appreciate the reviewers and editors for their careful reading, valuable
suggestions, timely review and reply.

References

[1] E.S. Epstein, On obtaining daily climatological values from monthly means, J. Climate 4 (1991) 365–372.
[2] P. Killworth, Time interpolation of forcing fields in ocean models, J. Phys. Oceanogr. 26 (1996) 136–143.
[3] J. Huang, Y. Chen, A regularization method for the function reconstruction from approximate average fluxes, Inverse Probl. 21 (2005) 1667–1684.
[4] Y. Chen, J. Huang, W. Han, Function reconstruction from noisy local averages, Inverse Probl. 24 (2008), doi:10.1088/0266-5611/24/2/025003.
[5] E.J.M. Delhez, A spline interpolation technique that preserve mass budget, Appl. Math. Lett. 16 (2003) 17–26.
[6] H. Behforooz, Approximation by integro cubic splines, Appl. Math. Comput. 175 (2006) 8–15.
[7] T. Zhanlav, R. Mijiddorj, The local integro cubic splines and their approximation properties, Appl. Math. Comput. 216 (2010) 2215–2219.
[8] H. Behforooz, Interpolation by integro quintic splines, Appl. Math. Comput. 216 (2010) 364–367.
[9] I.J. Schoenberg, Contribution to the problem of approximation of equidistant data by analytic functions, Quart. Appl. Math. 4 (1946) 45–99 and 112–141.
[10] R.H. Wang, Numerical Approximation, Higher Education Press, Beijing, 1999.
[11] C. De Boor, A Practical Guide to Splines, Springer-Verlag, New York, 1978.
[12] L. Schumaker, Spline Functions: Basic Theory, 3rd edition, Cambridge University Press, Cambridge, 2007.
[13] F.G. Lang, X.P. Xu, Quintic b-spline collocation method for second order mixed boundary value problem, Comput. Phys. Commun. 183 (2012) 913–921.
[14] D.J. Fyfe, The use of cubic splines in the solution of two point boundary value problems, Comput. J. 12 (1969) 188–192.
[15] T.R. Lucas, Error bounds for interpolating cubic splines under various end conditions, SIAM J. Numer. Anal. 11 (1974) 569–584.
[16] S.S. Sastry, Introductory methods of numerical analysis, fourth ed., PHI Learning, 2009.
[17] F.G. Lang, X.P. Xu, Quartic b-spline collocation method for fifth order boundary value problems, Comput. 92 (2011) 365–378.
[18] J. Goh, A.A. Majid, A.I.M. Ismail, Numerical method using cubic b-spline for the heat and wave equation, Comp. Math. Appl. 62 (2011) 4492–4498.
[19] J. Stoer, R. Bulirsch, An Introduction to Numerical Analysis, second edition, Springer-Verlag, New York, 1993.
[20] E. Süli, D.F. Mayers, An Introduction to Numerical Analysis, Cambridge University Press, Cambridge, 2003.
[21] A. Quarteroni, R. Sacco, F. Saleri, Numerical Mathematics, second edition, Springer, Berlin, 2007.