Next Article in Journal
Large Scale Implementations for Twitter Sentiment Classification
Previous Article in Journal
Optimization-Based Approaches to Control of Probabilistic Boolean Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A New Quintic Spline Method for Integro Interpolation and Its Error Analysis

School of Mathematical Sciences, Ocean University of China, Qingdao 266100, China
Algorithms 2017, 10(1), 32; https://doi.org/10.3390/a10010032
Submission received: 24 December 2016 / Revised: 26 February 2017 / Accepted: 1 March 2017 / Published: 3 March 2017

Abstract

:
In this paper, to overcome the innate drawbacks of some old methods, we present a new quintic spline method for integro interpolation. The method is free of any exact end conditions, and it can reconstruct a function and its first order to fifth order derivatives with high accuracy by only using the given integral values of the original function. The approximation properties of the obtained integro quintic spline are well studied and examined. The theoretical analysis and the numerical tests show that the new method is very effective for integro interpolation.

1. Introduction

Assume that y = y ( x ) is an unknown univariate real-valued function over [ a , b ] . Let:
Δ : = { a = x 0 < x 1 < < x n = b }
be the uniform partition of a , b with step length h : = b a n , and let:
I j : = x j x j + 1 y ( x ) d x ( j = 0 , 1 , ... , n 1 )
be the known integral values of y = y ( x ) over the subintervals.
The interpolation function p = p ( x ) that satisfies:
x j x j + 1 p ( x ) d x = I j ( j = 0 , 1 , ... , n 1 )
is called integro interpolation. The problem arises in many fields, such as numerical analysis, mathematical statistics, environmental science, mechanics, electricity, climatology, oceanography, and so on. We refer to [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19] for its applied backgrounds and some recent developments.
In this paper, we will mainly focus on the quintic spline methods; see [2,14,17,18,19] for the existing ones.
The method in [2] was based on the quintic Hermite–Birkhoff polynomials. The method was very complicated because it mainly required solving two linear systems. Furthermore, besides the integral values (2), the method must use seven additional exact end conditions in terms of y ( x 0 ) , y ( x 0 ) , y ( x 1 ) , y ( x n 1 ) , y ( x n ) , y ( x 0 ) and y ( x n ) . Later, a new algorithm was given in [18] to simplify the construction of integro quintic spline. It mainly required solving two linear three-diagonal systems. It was kind of simpler than that of [2]. However, the algorithm needed five special and proper exact end conditions in terms of y ( x 0 ) , y ( x 1 ) , y ( x n 1 ) , y ( x 1 ) and y ( x n 1 ) . The method in [14] was based on quintic B-splines. It was also very simple because it took advantage of the good properties of quintic B-splines. However, five additional exact end conditions in terms of y ( x 0 ) , y ( x 1 ) , y ( x 2 ) , y ( x n 1 ) and y ( x n ) must be provided. In other words, these methods all need exact end conditions. This is an obvious drawback of them. New simple methods that are not dependent on exact end conditions are desired.
In [17], we have studied an effective method that was not dependent on any exact end conditions. We first obtained n + 1 approximate function values at the knots and four approximate boundary derivative values from the integral values (2) and then used them to study a modified quintic spline interpolation problem. However, the method also had its own drawbacks. On the one hand, it needed n + 5 artificial values, which brought higher computational cost; on the other hand, the obtained quintic spline did not agree with the given integral values (2) over the subintervals. In [19], a local integro quintic spline method was given. It was also not dependent on exact end conditions and was able to produce good approximations. However, the obtained local integro quintic spline also did not agree with the given integral values (2) over the subintervals. Hence, these methods also need improvements. New attempts on this problem are still necessary.
In this paper, we aim to develop a new effective method to overcome the above-mentioned drawbacks. We will first construct six artificial end conditions by using a similar technique to [17] and use them together with the integral values (2) to get a new kind of integro quintic spline; then, we will theoretically analyze and numerically examine the approximation properties of the new integro quintic spline. The new method is very effective, and it has the following advantages.
(I)
The method is free of any exact end conditions, and it only requires five artificial end conditions, which can be easily obtained by simple computations from several integral values.
(II)
The computational procedure of the method is concise and easy to implement.
(III)
The obtained quintic spline agrees with the given integral values (2) over the subintervals.
(IV)
The obtained quintic spline can provide satisfactory approximations to y ( k ) ( x ) , k = 0 , 1 , 2 , 3 , 4 , 5 .
Hence, this method is very applicable for the integro interpolation problem.
The remainder of this paper is organized as follows. In Section 2, we compute some artificial end conditions by using several integral values; in Section 3, we construct our new integro quintic spline with five artificial end conditions; the approximation abilities of the integro quintic spline are theoretically studied in Section 4 and numerically tested in Section 5; finally, we conclude our paper in Section 6.

2. Artificial End Conditions

In this section, we study some new artificial end conditions for integro interpolation.
It is assumed that y = y ( x ) is a function of class C 7 [ a , b ] throughout this paper. In order to get the highest error orders, we will use seven boundary integral values to construct some proper linear combinations of them as the artificial end conditions. By expanding y = y ( x ) at x = x 0 by using the Taylor formula and computing the integral on [ x 0 , x m ] , m = 1 , 2 , ... , 7 , we obtain:
= 0 m 1 I = x 0 x m y ( x ) d x = y 0 ( m h ) + y 0 2 ! ( m h ) 2 + y 0 3 ! ( m h ) 3 + y 0 4 ! ( m h ) 4 + y 0 ( 4 ) 5 ! ( m h ) 5 + y 0 ( 5 ) 6 ! ( m h ) 6 + y 0 ( 6 ) 7 ! ( m h ) 7 + O ( h 8 ) .
For = 1 , 2 , ... , 7 , let λ , ω and μ be three parameters, such that:
1 2 3 4 5 6 7 1 2 2 3 2 4 2 5 2 6 2 7 2 1 2 3 3 3 4 3 5 3 6 3 7 3 1 2 4 3 4 4 4 5 4 6 4 7 4 1 2 5 3 5 4 5 5 5 6 5 7 5 1 2 6 3 6 4 6 5 6 6 6 7 6 1 2 7 3 7 4 7 5 7 6 7 7 7 λ 1 ω 1 μ 1 λ 2 ω 2 μ 2 λ 3 ω 3 μ 3 λ 4 ω 4 μ 4 λ 5 ω 5 μ 5 λ 6 ω 6 μ 6 λ 7 ω 7 μ 7 = 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 .
Explicitly,
λ 1 = 7 , λ 2 = 21 2 , λ 3 = 35 3 , λ 4 = 35 4 , λ 5 = 21 5 , λ 6 = 7 6 , λ 7 = 1 7 , ω 1 = 223 20 , ω 2 = 879 40 , ω 3 = 949 36 , ω 4 = 41 2 , ω 5 = 201 20 , ω 6 = 1019 360 , ω 7 = 7 20 , μ 1 = 319 45 , μ 2 = 3929 240 , μ 3 = 389 18 , μ 4 = 2545 144 , μ 5 = 134 15 , μ 6 = 1849 720 , μ 7 = 29 90 .
By using (4) and using these parameters λ , ω and μ , = 1 , 2 , ... , 7 , as the linear combination coefficients, we obtain:
m = 1 7 ( λ m = 0 m 1 I ) = 1 420 ( 1089 I 0 1851 I 1 + 2559 I 2 2341 I 3 + 1334 I 4 430 I 5 + 60 I 6 ) = y 0 h + O ( h 8 ) ,
m = 1 7 ( ω m = 0 m 1 I ) = 1 360 ( 938 I 0 + 3076 I 1 4835 I 2 + 4655 I 3 2725 I 4 + 893 I 5 126 I 6 ) = 1 2 y 0 h 2 + O ( h 8 ) ,
m = 1 7 ( μ m = 0 m 1 I ) = 1 720 ( 967 I 0 4137 I 1 + 7650 I 2 7910 I 3 + 4815 I 4 1617 I 5 + 232 I 6 ) = 1 6 y 0 h 3 + O ( h 8 ) .
Similarly, we also can get some corresponding results at the right end point. Based on (5)–(7) and the corresponding results at the right end point, let:
y ^ 0 = 1 420 h 1089 I 0 1851 I 1 + 2559 I 2 2341 I 3 + 1334 I 4 430 I 5 + 60 I 6 ,
y ^ 0 = 1 180 h 2 938 I 0 + 3076 I 1 4835 I 2 + 4655 I 3 2725 I 4 + 893 I 5 126 I 6 ,
y ^ 0 = 1 120 h 3 967 I 0 4137 I 1 + 7650 I 2 7910 I 3 + 4815 I 4 1617 I 5 + 232 I 6 ,
and:
y ^ n = 1 420 h 1089 I n 1 1851 I n 2 + 2559 I n 3 2341 I n 4 + 1334 I n 5 430 I n 6 + 60 I n 7 ,
y ^ n = 1 180 h 2 938 I n 1 3076 I n 2 + 4835 I n 3 4655 I n 4 + 2725 I n 5 893 I n 6 + 126 I n 7 ,
y ^ n = 1 120 h 3 967 I n 1 4137 I n 2 + 7650 I n 3 7910 I n 4 + 4815 I n 5 1617 I n 6 + 232 I n 7 .
It is straightforward to prove that:
y ^ 0 y 0 = O ( h 7 ) , y ^ 0 y 0 = O ( h 6 ) , y ^ 0 y 0 = O ( h 5 ) ,
y ^ n y n = O ( h 7 ) , y ^ n y n = O ( h 6 ) , y ^ n y n = O ( h 5 ) .
Let θ n = y ^ n + 1 10 h 2 y ^ n , by using (10) and (12); then, we get:
θ n = 1 8400 h 28549 I n 1 65979 I n 2 + 104730 I n 3 102190 I n 4 + 60385 I n 5 19919 I n 6 + 2824 I n 7
and it holds:
θ n y n + 1 10 h 2 y n = O h 7 .
In the next section, (7)–(9), (11) and (15) will be used as the artificial end conditions for integro interpolation; see (18) and (19).

3. Integro Quintic Spline Interpolation with Five Artificial End Conditions

In this section, we will use the given integral values (2) and the artificial end conditions in Section 2 to construct an integro quintic spline. Five additional independent conditions are needed. To use the results of (10) and (12) sufficiently, we will directly use the hybrid result of (15).
We look for the quintic spline s, which satisfies the following conditions:
x j x j + 1 s ( x ) d x = I j , j = 0 , 1 , ... , n 1 ,
s ( a ) = y ^ 0 , s ( a ) = y ^ 0 , s ( a ) = y ^ 0 ,
and:
s ( b ) + 1 10 h 2 s ( b ) = θ n , s ( b ) = y ^ n .
It belongs to the spline space of C 4 quintic piecewise polynomial functions on the uniform partition Δ (1), so s can be expressed as a linear combination of the quintic B-splines associated with the extended partition of Δ (1) with knots a + i h , 5 i n + 5 , i.e.,:
s = i = 2 n + 2 c i B i ,
where (see, e.g., [6,14,20,21]):
B i x = 1 120 h 5 x x i 3 5 , if x x i 3 , x i 2 , x x i 3 5 6 x x i 2 5 , if x x i 2 , x i 1 , x x i 3 5 6 x x i 2 5 + 15 x x i 1 5 , if x x i 1 , x i , x i + 3 x 5 6 x i + 2 x 5 + 15 x i + 1 x 5 , if x x i , x i + 1 , x i + 3 x 5 6 x i + 2 x 5 , if x x i + 1 , x i + 2 , x i + 3 x 5 , if x x i + 2 , x i + 3 , 0 , otherwise .
For the sake of completeness, we give in Table 1 the values of B i at the knots in x i 3 , x i + 3 . Furthermore, we have the following integro properties:
x i 3 x i 2 B i x d x = x i + 2 x i + 3 B i ( x ) d x = 1 720 h ,
x i 2 x i 1 B i x d x = x i + 1 x i + 2 B i ( x ) d x = 57 720 h ,
x i 1 x i B i x d x = x i x i + 1 B i ( x ) d x = 302 720 h ,
x j x j + 1 B i x d x = 0 , j i + 3 or j i 4 .
From (17) and (23), we have:
x j x j + 1 s ( x ) d x = i = j 2 j + 3 c i x j x j + 1 B i ( x ) d x = I j .
Hence, for j = 0 , 1 , ... , n 1 , by using (20)–(22), we get:
h 720 ( c j 2 + 57 c j 1 + 302 c j + 302 c j + 1 + 57 c j + 2 + c j + 3 ) = I j .
Since s ( a ) = y ^ 0 , it holds:
c 2 + 26 c 1 + 66 c 0 + 26 c 1 + c 2 = 120 y ^ 0 .
The condition s ( a ) = y ^ 0 provides the equality:
c 2 10 c 1 + 10 c 1 + c 2 = 24 h y ^ 0 .
Similarly, from s ( a ) = y ^ 0 , it follows that:
c 2 + 2 c 1 6 c 0 + 2 c 1 + c 2 = 6 h 2 y ^ 0 .
Taking into account that s ( b ) + 1 10 h 2 s ( b ) = θ n , we get:
1 120 ( c n 2 + 26 c n 1 + 66 c n + 26 c n + 1 + c n + 2 ) + h 2 10 · 1 6 h 2 ( c n 2 + 2 c n 1 6 c n + 2 c n + 1 + c n + 2 ) = θ n ,
that is:
1 40 ( c n 2 + 10 c n 1 + 18 c n + 10 c n + 1 + c n + 2 ) = θ n .
Finally, from s ( b ) = y ^ n , it follows that:
c n 2 10 c n 1 + 10 c n + 1 + c n + 2 = 24 h y ^ n .
Therefore, we get the linear system:
A C = Y ,
where
A = 1 26 66 26 1 1 10 0 10 1 1 2 6 2 1 1 57 302 302 57 1 1 57 302 302 57 1 1 57 302 302 57 1 1 57 302 302 57 1 1 10 18 10 1 1 10 0 10 1 ( n + 5 ) × ( n + 5 ) ,
and:
C = ( c 2 , c 1 , c 0 , c 1 , , c n + 1 , c n + 2 ) T ,
Y = ( 120 y ^ 0 , 24 h y ^ 0 , 6 h 2 y ^ 0 , 720 h I 0 , , 720 h I n 1 , 40 θ n , 24 h y ^ n ) T .
Theorem 1.
The coefficient matrix A (27) is invertible.
Proof. 
We will prove that the determinant of matrix A is nonzero. We will perform some proper elementary transformations to A in order to verify | A | 0 . Let C ( i ) denote the i-th column and R ( i ) denote the i-th row of a matrix obtained by an elementary row or column transformation.
We first perform n + 4 elementary column transformations to A.
Step 1: For i = n + 4 , n + 3 , ... , 1 , C ( i ) : = C ( i ) C ( i + 1 ) .
Then, we get:
A 1 = 16 15 41 25 1 0 1 9 9 1 8 9 7 1 1 0 1 56 246 56 1 0 1 56 246 56 1 1 56 246 56 1 1 56 246 56 1 0 1 9 9 1 0 1 9 9 1 ( n + 5 ) × ( n + 5 ) .
We continue to perform the following elementary row transformations to A 1 .
Step 2: 
R ( 3 ) : = 2 3 R ( 3 ) + 1 3 R ( 1 ) ;
Step 3: 
R ( 3 ) : = R ( 3 ) + R ( 2 ) , and R ( n + 4 ) : = R ( n + 4 ) R ( n + 5 ) ;
Step 4: 
R ( 4 ) : = R ( 4 ) + R ( 2 ) , and R ( n + 3 ) : = R ( n + 3 ) R ( n + 5 ) ;
Step 5: 
R ( 5 ) : = R ( 5 ) 1 47 R ( 4 ) , and R ( n + 2 ) : = R ( n + 2 ) 1 47 R ( n + 3 ) ;
Step 6: 
R ( 3 ) R ( 4 ) , and R ( n + 4 ) R ( n + 3 ) .
Thus, we get:
A 2 = 16 15 41 25 1 0 0 0 1 9 9 1 0 0 0 0 47 255 57 1 0 0 0 0 18 2 0 0 2377 47 11505 47 2631 47 1 1 56 246 56 1 1 56 246 56 1 1 56 246 56 1 1 56 246 56 1 1 2631 47 11505 47 2377 47 0 0 2 18 0 0 0 1 57 255 47 0 0 0 1 9 9 1 ( n + 5 ) × ( n + 5 ) .
By the basic knowledge of linear algebra, we have:
| A 2 | = 16 × ( 1 ) × 47 × | C n n | × 47 × 1 ,
where C n n is the central block matrix of A 2 . C n n is strictly diagonally dominant, and so, | C n n | 0 . It implies that | A 2 | 0 and, hence, | A | 0 . In other words, A (27) is invertible, and the theorem is proven. ☐
Theorem 1 guarantees the existence and uniqueness of the integro quintic spline s = i = 2 n + 2 c i B i ( x ) determined by (17)–(19). It can be constructed as follows:
(I): 
Compute y ^ 0 , y ^ 0 , y ^ 0 , y ^ n and θ n by using (7)–(9), (11) and (15), respectively;
(II): 
Solve the system (26) to get c j , j = 2 , 1 , 0 , ... , n + 2 .
Evidently, the new method is free of exact end conditions and is easy to implement. Furthermore, the obtained quintic spline s satisfies the conditions given in (2).

4. Approximation Properties

In this section, we study the approximation properties of the integro quintic spline s obtained in Section 3.
For k = 0 , 1 , ... , 5 , we use y j ( k ) to denote y ( k ) ( x j ) , j = 0 , 1 , ... , n . For k = 0 , 1 , 2 , 3 , 4 , we use s j , m j , M j , T j and F j to denote s ( k ) ( x j ) , j = 0 , 1 , ... , n . In addition, we define:
W j : = F j + 1 F j 1 2 h
in order to approximate y ( 5 ) ( x j ) , j = 1 , 2 , ... , n 1 . For j = 0 , 1 , ... , n ,
s j = 1 120 ( c j 2 + 26 c j 1 + 66 c j + 26 c j + 1 + c j + 2 ) , m j = 1 24 h ( c j 2 10 c j 1 + 10 c j + 1 + c j + 2 ) , M j = 1 6 h 2 ( c j 2 + 2 c j 1 6 c j + 2 c j + 1 + c j + 2 ) , T j = 1 2 h 3 ( c j 2 + 2 c j 1 2 c j + 1 + c j + 2 ) , F j = 1 h 4 ( c j 2 4 c j 1 + 6 c j 4 c j + 1 + c j + 2 ) .
Moreover,
W j = 1 2 h 5 ( c j 3 + 4 c j 2 5 c j 1 + 5 c j + 1 4 c j + 2 + c j + 3 ) , j = 1 , 2 , ... , n 1 .
By using (24), (25) and the above results, we can get some important relations between s j , m j , M j , T j , F j , W j and I j of the integro quintic spline. We list the relations as follows.
(Set I)
347 m 0 + 1044 m 1 + 225 m 2 + 4 m 3 = 1 h 2 ( 120 I 2 + 1110 I 1 690 I 0 ) 540 h s 0 54 h M 0 ;
for j = 2 , 3 , ... , n 2 ,
m j 2 + 56 m j 1 + 246 m j + 56 m j + 1 + m j + 2 = 30 h 2 ( I j 2 9 I j 1 + 9 I j + I j + 1 ) ;
4 m n 3 + 225 m n 2 + 1044 m n 1 + 347 m n = 1 h 2 ( 690 I n 1 1110 I n 2 120 I n 3 ) + 540 h θ n .
(Set II)
For j = 0 , 1 , ... , n 3 ,
T j = 2 3 h 2 ( 28 m j + 245 m j + 1 + 56 m j + 2 + m j + 3 ) + 20 h 4 ( 10 I j 9 I j + 1 I j + 2 ) ;
for j = 3 , 4 , ... , n ,
T j = 2 3 h 2 ( m j 3 + 56 m j 2 + 245 m j 1 + 28 m j ) 20 h 4 ( 10 I j 1 9 I j 2 I j 3 ) .
(Set III)
s 1 = s 0 + 1 18 h ( 47 I 0 10 I 1 I 2 ) + h 540 ( 61 m 0 + 363 m 1 + 57 m 2 + m 3 ) ;
s 2 = s 0 + 1 3 h ( 8 I 0 + 8 I 1 ) + h 9 ( m 0 8 m 1 + m 2 ) ;
for j = 3 , 4 , ... , n ,
s j = s j 3 + 1 18 h ( 47 I j 3 58 I j 2 + 47 I j 1 ) + h 540 ( 61 m j 3 + 423 m j 2 423 m j 1 + 61 m j ) .
(Set IV)
M 0 = y ^ 0 = 10 h 3 I 0 10 h 2 s 0 13 3 h m 0 2 3 h m 1 h 9 T 0 + h 36 T 1 ;
for j = 1 , 2 , ... , n ,
M j = 10 h 3 I j 1 + 10 h 2 s j 1 + 7 3 h m j 1 + 8 3 h m j h 18 T j 1 + 5 h 36 T j .
(Set V)
F 0 = 120 h 5 I 0 + 120 h 4 s 0 + 40 h 3 m 0 + 20 h 3 m 1 11 3 h T 0 4 3 h T 1 ;
for j = 1 , 2 , ... , n ,
F j = 120 h 5 I j 1 120 h 4 s j 1 40 h 3 m j 1 20 h 3 m j + 5 3 h T j 1 + 10 3 h T j .
(Set VI)
W 1 = 60 h 6 ( I 0 + I 1 ) 60 h 5 ( s 0 + s 1 ) 10 h 4 ( 2 m 0 + 3 m 1 + m 2 ) + 1 6 h 2 ( 11 T 0 + 9 T 1 + 10 T 2 ) ;
for j = 2 , 3 , ... , n 1 ,
W j = 60 h 6 ( I j I j 2 ) 60 h 5 ( s j s j 2 ) 20 h 4 ( m j m j 2 ) 10 h 4 ( m j + 1 m j 1 ) + 5 6 h 2 ( T j 2 2 T j 1 + T j + 2 T j + 1 ) .
Theorem 2.
Let s be the integro quintic spline determined by (17)–(19) with the artificial end conditions given in Section 2. For j = 0 , 1 , ... , n , we have:
s j = y j + O ( h 6 ) ,
m j = y j + O ( h 6 ) ,
M j = y j + O ( h 4 ) ,
T j = y j + O ( h 4 ) ,
F j = y j ( 4 ) + O ( h 2 ) .
For j = 1 , 2 , ... , n 1 , we have:
W j = y j ( 5 ) + O ( h 2 ) .
Proof. 
We first prove (43). We define e j : = m j y j , j = 0 , 1 , ... , n . From (28) and (13), we get:
347 e 0 + 1044 e 1 + 225 e 2 + 4 e 3 = ( 347 m 0 + 1044 m 1 + 225 m 2 + 4 m 3 ) ( 347 y 0 + 1044 y 1 + 225 y 2 + 4 y 3 ) = 1 h 2 ( 120 I 2 + 1110 I 1 690 I 0 ) 540 h y ^ 0 54 h y ^ 0 ( 347 y 0 + 1044 y 1 + 225 y 2 + 4 y 3 ) = 1 h 2 { 1800 I 0 + 990 ( I 0 + I 1 ) + 120 ( I 0 + I 1 + I 2 ) } 540 h ( y 0 + O ( h 7 ) ) 54 h ( y 0 + O ( h 5 ) ) ( 347 y 0 + 1044 y 1 + 225 y 2 + 4 y 3 ) ( continue to expand it at x 0 by using ( 4 ) and the Taylor formula ) = O ( h 6 ) .
Similarly, from (30) and (14), it follows that:
4 e n 3 + 225 e n 2 + 1044 e n 1 + 347 e n = O ( h 6 ) .
Besides, for j = 2 , 3 , ... , n 2 , from (29), it follows that:
e j 2 + 56 e j 1 + 246 e j + 56 e j + 1 + e j + 2 = ( m j 2 + 56 m j 1 + 246 m j + 56 m j + 1 + m j + 2 ) ( y j 2 + 56 y j 1 + 246 y j + 56 y j + 1 + y j + 2 ) = 30 h 2 ( I j 2 9 I j 1 + 9 I j + I j + 1 ) ( y j 2 + 56 y j 1 + 246 y j + 56 y j + 1 + y j + 2 ) = 30 h 2 { 8 I j 2 18 ( I j 2 + I j 1 ) + 8 ( I j 2 + I j 1 + I j ) + ( I j 2 + I j 1 + I j + I j + 1 ) } ( y j 2 + 56 y j 1 + 246 y j + 56 y j + 1 + y j + 2 ) ( continue to expand it at x j 2 by using a similar formula of ( 4 ) and the Taylor formula ) = O ( h 6 ) .
Take into account:
e 0 = m 0 y 0 = y ^ 0 y 0 = O ( h 6 ) ,
e n = m n y n = y ^ n y n = O ( h 6 ) ,
we get:
1 347 1044 225 4 1 56 246 56 1 1 56 246 56 1 4 225 1044 347 1 e 0 e 1 e 2 e n 2 e n 1 e n = O ( h 6 ) O ( h 6 ) O ( h 6 ) O ( h 6 ) O ( h 6 ) O ( h 6 ) .
The coefficient matrix is strictly diagonally dominant. The infinity norm of its inverse is bounded. Hence, (43) is proven.
By using (31) and (43), we get:
T j y j = 2 3 h 2 ( 28 ( y j + O ( h 6 ) ) + 245 ( y j + 1 + O ( h 6 ) ) + 56 ( y j + 2 + O ( h 6 ) ) + ( y j + 3 + O ( h 6 ) ) ) + 20 h 4 ( 10 I j 9 I j + 1 I j + 2 ) y j = O ( h 4 ) , j = 0 , 1 , ... , n 3 .
It shows that (45) holds for j = 0 , 1 , ... , n 3 . Similarly, by using (32) and (43), we get that (45) holds for j = n 2 , n 1 , n .
From (13), it follows that s 0 = y ^ 0 = y 0 + O ( h 7 ) . By using (33)–(35), (43) and (45), we get s j y j = O ( h 6 ) , j = 1 , 2 , ... , n . Therefore, (42) is proven.
From (13), it follows that M 0 = y ^ 0 = y 0 + O ( h 5 ) . Moreover, by using (37), (42), (43) and (45), we have:
M j y j = 10 h 3 I j 1 + 10 h 2 ( y j 1 + O ( h 6 ) ) + 7 3 h ( y j 1 + O ( h 6 ) ) + 8 3 h ( y j + O ( h 6 ) ) h 18 ( y j 1 + O ( h 4 ) ) + 5 h 36 ( y j + O ( h 4 ) ) y j = O ( h 4 ) , j = 1 , 2 , ... , n .
Therefore, (44) is proven. In addition, (46) and (47) can be proven similarly by using (38)–(41) and (42), (43) and (45).
Theorem 2 shows that the new integro quintic spline has super convergence in locally approximating y j ( k ) , k = 1 , 3 , 5 , and full convergence in locally approximating y j ( k ) , k = 0 , 2 , 4 .
Theorem 3.
Let s be the integro quintic spline determined by (17)–(19) with the artificial end conditions given in Section 2; we have:
s ( k ) ( x ) y ( k ) ( x ) = O ( h 6 k ) , k = 0 , 1 , 2 , 3 , 4 , 5 ,
where · : = max a x b | · | , and s ( 5 ) ( x ) is defined as follows:
s ( 5 ) ( x ) = F j + 1 F j h , x j < x < x j + 1 , j = 0 , 1 , 2 , ... , n 1 , s ( 5 ) ( x 0 ) = F 1 F 0 h , s ( 5 ) ( x n ) = F n F n 1 h , s ( 5 ) ( x j ) = W j , j = 1 , 2 , ... , n 1 .
Proof. 
By using (46), for x ( x j , x j + 1 ) , j = 0 , 1 , 2 , ... , n 1 ,
s ( 5 ) ( x ) y ( 5 ) ( x ) = F j + 1 F j h y ( 5 ) ( x ) = y j + 1 ( 4 ) y j ( 4 ) h y ( 5 ) ( x ) + O ( h ) = y ( 5 ) ( ξ j ) y ( 5 ) ( x ) + O ( h ) = y ( 6 ) ( η j ) ( ξ j x ) + O ( h ) = O ( h ) ,
where η j , ξ j ( x j , x j + 1 ) . Moreover, we have s ( 5 ) ( x 0 ) y 0 ( 5 ) = O ( h ) , s ( 5 ) ( x n ) y n ( 5 ) = O ( h ) and s ( 5 ) ( x j ) y j ( 5 ) = O ( h 2 ) , j = 1 , 2 , ... , n 1 . Hence,
s ( 5 ) ( x ) y ( 5 ) ( x ) = O ( h ) .
Next, for x [ x j , x j + 1 ] , j = 0 , 1 , 2 , ... , n 1 ,
s ( 4 ) ( x ) y ( 4 ) ( x ) = ( F j + F j + 1 F j h ( x x j ) ) ( y j ( 4 ) + y j ( 5 ) ( x x j ) + O ( h 2 ) ) = O ( h 2 ) + ( F j + 1 F j h y j ( 5 ) ) ( x x j ) = O ( h 2 ) .
Hence, we get
s ( 4 ) ( x ) y ( 4 ) ( x ) = O ( h 2 ) .
The others also can be proven similarly. We omit the proof. ☐
Theorem 3 shows that the new integro quintic spline has full convergence in globally approximating y ( k ) ( x ) , k = 0 , 1 , ... , 5 .

5. Numerical Tests

In this section, we test the approximation properties of the new integro quintic spline. Our tests are performed by MATLAB.
We take:
y 1 = e x , x [ 0 , 1 ] ,
and:
y 2 = sin x , if x 0 . 5 , 0 , x x 3 3 ! + x 5 5 ! x 7 7 ! , if x 0 , 0 . 5 ,
as two illustrative examples. Furthermore, y 1 will be used in the comparison of our method with some other methods.
The absolute errors at the knots are defined as follows:
E k ( x i , n ) : = | y ( k ) ( x i ) s ( k ) ( x i ) | , k = 0 , 1 , 2 , 3 , 4 , i = 0 , 1 , ... , n ,
and:
E 5 ( x i , n ) : = | y ( 5 ) ( x i ) s ( 4 ) ( x i + 1 ) s ( 4 ) ( x i 1 ) 2 h | , i = 1 , 2 , ... , n 1 .
The numerical convergence orders of the absolute errors at the knots are defined by:
O k ( x i , n 1 , n 2 ) : = log ( E k ( x i , n 1 ) / E k ( x i , n 2 ) ) log ( n 2 / n 1 ) , k = 0 , 1 , ... , 5 .
Table 2, Table 3, Table 4, Table 5, Table 6 and Table 7 show the absolute errors E k ( x i , n ) of y 1 ( k ) ( x ) at the chosen knots and the numerical convergence orders O k ( x i , n 1 , n 2 ) , where n = 10 , 20 , 40 , k = 0 , 1 , ... , 5 . The results of y 2 ( k ) ( x ) are given in Table 8, Table 9, Table 10, Table 11, Table 12 and Table 13.
The numerical convergence orders in these tables accord with the theoretical expectation. By Theorem 2, E 0 ( x i , n ) and E 1 ( x i , n ) are of sixth order convergent (see Table 2, Table 3, Table 8 and Table 9 for the numerical convergence orders), E 2 ( x i , n ) and E 3 ( x i , n ) are of fourth order convergent (see Table 4, Table 5, Table 10 and Table 11 for the numerical convergence orders), E 4 ( x i , n ) and E 5 ( x i , n ) are of second order convergent (see Table 6, Table 7, Table 12 and Table 13 for the numerical convergence orders).
Moreover, all of the absolute errors in these tables are very satisfactory and well accepted. Making a further observation on these tables, we find that the errors at the inner knots are much better than the errors at the left endpoint and the right endpoint. The numerical phenomenon is natural and reasonable, because we only make use of n integral values (2) and do not make use of any exact end conditions. It shows that the influence of the artificial end conditions on the inner errors is limited. In fact, the inner approximation errors are mainly determined by the given n integral values in (2), while the boundary errors are mainly effected by the artificial end conditions. It is checked that our inner errors of y 1 in Table 2, Table 3, Table 4, Table 5 and Table 6 are similar to the ones in [2,14,18], which are obtained by using five or seven additional exact end conditions. It shows that our new method can obtain satisfactory approximation results by using fewer data than the methods in [2,14,18]. The performance is very encouraging.
Finally, we give some discussion on fifth order derivative approximation. We remark that we use:
W i = s ( 4 ) ( x i + 1 ) s ( 4 ) ( x i 1 ) 2 h = F i + 1 F i 1 2 h
to approximate y ( 5 ) ( x i ) in this paper, i = 1 , 2 , ... , n 1 . See Table 7 and Table 13 for our numerical results of the fifth order derivatives. Take y 1 as a comparison example. See Table 14 for the comparison of the maximum absolute errors of the fifth order derivatives y 1 ( 5 ) ( x i ) obtained by our current method and the methods in [18,19]. Obviously, our results are very accurate and surprising because they are obtained by only using the integral values (2) with no exact end conditions, while the results of [18] are obtained by using the integral values (2) and five additional exact end conditions ( y ( x 0 ) , y ( x 1 ) , y ( x n 1 ) , y ( x 1 ) and y ( x n 1 ) ), as well. Hence, our approximation method for the fifth order derivatives at the inner knots is more preferable.

6. Conclusions

In this paper, an effort that is different from the ones in [1,2,13,14,15,16,17,18,19] is made to construct a new kind of integro quintic spline without exact end conditions. The demands of exact end conditions in many old methods, such as [1,2,14,15,18], for integro interpolation have been relaxed and deleted in the new method. The good feature makes the current method possess wider applications than many other methods. Moreover, the method is easy to apply, and the obtained integro quintic spline has satisfactory approximation abilities in approximating a function and its first order to fifth order derivatives. Hence, the new method is very effective for integro interpolation.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (Grant No. 11501533). The author appreciates the reviewers and the editors very much for their careful reading, professional review and valuable suggestions.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Behforooz, H. Approximation by integro cubic splines. Appl. Math. Comput. 2006, 175, 8–15. [Google Scholar] [CrossRef]
  2. Behforooz, H. Interpolation by integro quintic splines. Appl. Math. Comput. 2010, 216, 364–367. [Google Scholar] [CrossRef]
  3. Boneva, L.I.; Kendall, D.G.; Stefanov, I. Spline transformations: three new diagnostic aids for the statistical data-analyst. J. R. Stat. Soc. Ser. B 1971, 33, 1–70. [Google Scholar]
  4. Boujraf, A.; Sbibih, D.; Tahrichi, M.; Tijini, A. A simple method for constructing integro spline quasi-interpolants. Math. Comput. Simul. 2015, 111, 36–47. [Google Scholar] [CrossRef]
  5. Costantini, P.; Pelosi, F. Shape preserving histogram approximation. Adv. Comput. Math. 2007, 26, 205–230. [Google Scholar] [CrossRef]
  6. DeBoor, C. A Practical Guide to Splines; Springer: New York, NY, USA, 1978. [Google Scholar]
  7. Delhez, E.J.M. A spline interpolation technique that preserve mass budget. Appl. Math. Lett. 2003, 16, 17–26. [Google Scholar] [CrossRef]
  8. Demichelis, V. Piecewise weighted mean functions and histograms. Rocky Mt. J. Math. 1998, 28, 1259–1265. [Google Scholar] [CrossRef]
  9. Epstein, E.S. On obtaining daily climatological values from monthly means. J. Clim. 1991, 4, 365–372. [Google Scholar] [CrossRef]
  10. Huang, J.; Chen, Y. A regularization method for the function reconstruction from approximate average fluxes. Inverse Probl. 2005, 21, 1667–1684. [Google Scholar] [CrossRef]
  11. Killworth, P. Time interpolation of forcing fields in ocean models. J. Phys. Oceanogr. 1996, 26, 136–143. [Google Scholar] [CrossRef]
  12. Klimchuk, J.A.; Patsourakos, S.; Tripathi, D. Intensity conserving spectral fitting. Sol. Phys. 2016, 291, 55–65. [Google Scholar] [CrossRef]
  13. Lang, F.G.; Xu, X.P. On integro quartic spline interpolation. J. Comput. Appl. Math. 2012, 236, 4214–4226. [Google Scholar] [CrossRef]
  14. Lang, F.G.; Xu, X.P. Quintic B-spline method for integro interpolation. Appl. Math. Comput. 2015, 263, 353–360. [Google Scholar] [CrossRef]
  15. Wu, J.; Zhang, X. Integro sextic spline interpolation and its super convergence. Appl. Math. Comput. 2013, 219, 6431–6436. [Google Scholar] [CrossRef]
  16. Wu, J.; Zhang, X. Integro quadratic spline interpolation. Appl. Math. Model. 2015, 39, 2973–2980. [Google Scholar] [CrossRef]
  17. Xu, X.P.; Lang, F.G. Quintic B-spline method for function reconstruction from integral values of successive subintervals. Numer. Algor. 2014, 66, 223–240. [Google Scholar] [CrossRef]
  18. Zhanlav, T.; Mijiddorj, R. Integro quintic splines and their approximation properties. Appl. Math. Comput. 2014, 231, 536–543. [Google Scholar] [CrossRef]
  19. Zhanlav, T.; Mijiddorj, R.; Behforooz, H. Construction of local integro quintic splines. Commun. Numer. Anal. 2016, 2016, 167–179. [Google Scholar] [CrossRef]
  20. Schoenberg, I.J. Contribution to the problem of approximation of equidistant data by analytic functions. Q. Appl. Math. 1946, 4, 45–99. [Google Scholar] [CrossRef]
  21. Wang, R.H. Numerical Approximation; Higher Education Press: Beijing, China, 1999. [Google Scholar]
Table 1. The values of B i k , k = 0 , 1 , 2 , 3 , 4 , at the knots lying in the interior of the support of B i .
Table 1. The values of B i k , k = 0 , 1 , 2 , 3 , 4 , at the knots lying in the interior of the support of B i .
x x i 2 x i 1 x i x i + 1 x i + 2
B i 1 120 26 120 66 120 26 120 1 120
B i 1 24 h 10 24 h 0 10 24 h 1 24 h
B i 1 6 h 2 2 6 h 2 6 6 h 2 2 6 h 2 1 6 h 2
B i ( 3 ) 1 2 h 3 2 2 h 3 0 2 2 h 3 1 2 h 3
B i ( 4 ) 1 h 4 4 h 4 6 h 4 4 h 4 1 h 4
Table 2. The absolute errors of the function values of y 1 at the knots and the numerical convergence orders.
Table 2. The absolute errors of the function values of y 1 at the knots and the numerical convergence orders.
x i E 0 ( x i , 10 ) E 0 ( x i , 20 ) E 0 ( x i , 40 ) O 0 ( x i , 10 , 20 ) O 0 ( x i , 10 , 40 )
0.0 1 . 711 × 10 8 1 . 141 × 10 10 7 . 632 × 10 13 7 . 2 7 . 2
0.1 2 . 512 × 10 9 4 . 480 × 10 12 2 . 887 × 10 15 9 . 1 9 . 8
0.2 7 . 533 × 10 10 1 . 627 × 10 12 7 . 105 × 10 15 8 . 9 8 . 3
0.3 4 . 974 × 10 10 1 . 433 × 10 12 1 . 998 × 10 15 8 . 4 8 . 9
0.4 3 . 287 × 10 10 1 . 351 × 10 12 1 . 799 × 10 14 7 . 9 7 . 1
0.5 4 . 105 × 10 10 1 . 277 × 10 12 5 . 107 × 10 15 8 . 3 8 . 1
0.6 2 . 701 × 10 10 1 . 187 × 10 12 5 . 773 × 10 15 7 . 8 7 . 7
0.7 2 . 914 × 10 10 1 . 075 × 10 12 1 . 954 × 10 14 8 . 1 6 . 9
0.8 3 . 233 × 10 10 7 . 208 × 10 13 1 . 643 × 10 14 8 . 8 7 . 1
0.9 2 . 535 × 10 9 4 . 620 × 10 12 3 . 108 × 10 15 9 . 1 9 . 7
1.0 2 . 403 × 10 8 2 . 195 × 10 10 1 . 720 × 10 12 6 . 8 6 . 9
Table 3. The absolute errors of the first order derivatives of y 1 at the knots and the numerical convergence orders.
Table 3. The absolute errors of the first order derivatives of y 1 at the knots and the numerical convergence orders.
x i E 1 ( x i , 10 ) E 1 ( x i , 20 ) E 1 ( x i , 40 ) O 1 ( x i , 10 , 20 ) O 1 ( x i , 10 , 40 )
0.0 8 . 837 × 10 7 1 . 181 × 10 8 1 . 599 × 10 10 6 . 2 6 . 2
0.1 7 . 198 × 10 8 1 . 782 × 10 10 6 . 932 × 10 13 8 . 7 8 . 4
0.2 1 . 321 × 10 8 5 . 626 × 10 12 9 . 104 × 10 15 11 . 2 10 . 1
0.3 3 . 138 × 10 9 3 . 064 × 10 12 6 . 535 × 10 13 10 . 0 6 . 1
0.4 4 . 357 × 10 10 3 . 753 × 10 12 2 . 014 × 10 13 6 . 9 5 . 5
0.5 6 . 093 × 10 10 4 . 163 × 10 12 2 . 633 × 10 13 7 . 2 5 . 5
0.6 6 . 225 × 10 10 4 . 451 × 10 12 4 . 776 × 10 13 7 . 1 5 . 1
0.7 4 . 399 × 10 9 4 . 471 × 10 12 1 . 275 × 10 13 9 . 9 7 . 5
0.8 1 . 839 × 10 8 1 . 034 × 10 11 2 . 132 × 10 13 10 . 8 8 . 1
0.9 1 . 020 × 10 7 3 . 315 × 10 10 9 . 912 × 10 13 8 . 3 8 . 3
1.0 1 . 300 × 10 6 2 . 363 × 10 8 3 . 788 × 10 10 5 . 8 5 . 8
Table 4. The absolute errors of the second order derivatives of y 1 at the knots and the numerical convergence orders.
Table 4. The absolute errors of the second order derivatives of y 1 at the knots and the numerical convergence orders.
x i E 2 ( x i , 10 ) E 2 ( x i , 20 ) E 2 ( x i , 40 ) O 2 ( x i , 10 , 20 ) O 2 ( x i , 10 , 40 )
0.0 2 . 647 × 10 5 7 . 099 × 10 7 1 . 949 × 10 8 5 . 2 5 . 2
0.1 4 . 869 × 10 7 1 . 820 × 10 9 3 . 831 × 10 10 8 . 1 5 . 1
0.2 2 . 978 × 10 7 1 . 957 × 10 9 4 . 236 × 10 10 7 . 2 4 . 7
0.3 5 . 713 × 10 7 3 . 211 × 10 9 5 . 213 × 10 10 7 . 5 5 . 0
0.4 1 . 569 × 10 7 4 . 450 × 10 9 3 . 785 × 10 10 5 . 1 4 . 3
0.5 5 . 861 × 10 7 5 . 800 × 10 9 6 . 002 × 10 10 6 . 7 4 . 9
0.6 9 . 784 × 10 8 7 . 297 × 10 9 7 . 447 × 10 10 3 . 7 3 . 5
0.7 6 . 007 × 10 7 8 . 972 × 10 9 5 . 578 × 10 10 6 . 1 5 . 0
0.8 1 . 011 × 10 7 1 . 108 × 10 8 7 . 138 × 10 10 3 . 2 3 . 5
0.9 7 . 946 × 10 7 1 . 825 × 10 8 8 . 472 × 10 10 5 . 4 4 . 9
1.0 4 . 041 × 10 5 1 . 462 × 10 6 4 . 772 × 10 8 4 . 8 4 . 8
Table 5. The absolute errors of the third order derivatives of y 1 at the knots and the numerical convergence orders.
Table 5. The absolute errors of the third order derivatives of y 1 at the knots and the numerical convergence orders.
x i E 3 ( x i , 10 ) E 3 ( x i , 20 ) E 3 ( x i , 40 ) O 3 ( x i , 10 , 20 ) O 3 ( x i , 10 , 40 )
0.0 5 . 275 × 10 4 2 . 780 × 10 5 1 . 471 × 10 6 4 . 2 4 . 2
0.1 7 . 466 × 10 5 1 . 054 × 10 6 5 . 170 × 10 9 6 . 1 6 . 8
0.2 1 . 955 × 10 5 2 . 196 × 10 8 2 . 435 × 10 9 9 . 8 6 . 4
0.3 5 . 064 × 10 6 3 . 244 × 10 8 2 . 362 × 10 9 7 . 3 5 . 5
0.4 4 . 352 × 10 7 3 . 852 × 10 8 2 . 592 × 10 10 3 . 5 5 . 3
0.5 1 . 209 × 10 6 4 . 265 × 10 8 5 . 388 × 10 9 4 . 8 3 . 9
0.6 6 . 714 × 10 7 4 . 702 × 10 8 1 . 748 × 10 9 3 . 8 4 . 2
0.7 7 . 116 × 10 6 4 . 759 × 10 8 1 . 095 × 10 9 7 . 2 6 . 3
0.8 2 . 705 × 10 5 4 . 163 × 10 8 4 . 917 × 10 9 9 . 3 6 . 1
0.9 1 . 027 × 10 4 1 . 950 × 10 6 9 . 570 × 10 9 5 . 7 6 . 6
1.0 8 . 400 × 10 4 6 . 182 × 10 5 4 . 229 × 10 6 3 . 8 3 . 8
Table 6. The absolute errors of the fourth order derivatives of y 1 at the knots and the numerical convergence orders.
Table 6. The absolute errors of the fourth order derivatives of y 1 at the knots and the numerical convergence orders.
x i E 4 ( x i , 10 ) E 4 ( x i , 20 ) E 4 ( x i , 40 ) O 4 ( x i , 10 , 20 ) O 4 ( x i , 10 , 40 )
0.0 6 . 139 × 10 3 5 . 105 × 10 4 2 . 006 × 10 5 3 . 6 4 . 0
0.1 1 . 166 × 10 3 2 . 577 × 10 4 5 . 397 × 10 5 2 . 2 2 . 2
0.2 1 . 219 × 10 3 2 . 171 × 10 4 5 . 919 × 10 5 2 . 5 2 . 0
0.3 1 . 414 × 10 3 2 . 406 × 10 4 6 . 602 × 10 5 2 . 6 2 . 1
0.4 8 . 417 × 10 4 2 . 700 × 10 4 7 . 006 × 10 5 1 . 6 1 . 8
0.5 1 . 806 × 10 3 3 . 026 × 10 4 8 . 012 × 10 5 2 . 6 2 . 2
0.6 1 . 046 × 10 3 3 . 387 × 10 4 8 . 963 × 10 5 1 . 6 1 . 7
0.7 2 . 303 × 10 3 3 . 783 × 10 4 9 . 521 × 10 5 2 . 6 2 . 2
0.8 5 . 430 × 10 4 4 . 165 × 10 4 1 . 067 × 10 4 0 . 4 1 . 1
0.9 5 . 952 × 10 3 3 . 446 × 10 4 1 . 174 × 10 4 4 . 1 2 . 8
1.0 1 . 311 × 10 2 2 . 204 × 10 3 3 . 719 × 10 4 2 . 6 2 . 6
Table 7. The absolute errors of the fifth order derivatives of y 1 at the knots and the numerical convergence orders.
Table 7. The absolute errors of the fifth order derivatives of y 1 at the knots and the numerical convergence orders.
x i E 5 ( x i , 10 ) E 5 ( x i , 20 ) E 5 ( x i , 40 ) O 5 ( x i , 10 , 20 ) O 5 ( x i , 10 , 40 )
0.1 3 . 494 × 10 2 2 . 340 × 10 3 3 . 900 × 10 6 3 . 9 6 . 5
0.2 1 . 086 × 10 2 1 . 096 × 10 4 6 . 875 × 10 5 6 . 6 3 . 6
0.3 4 . 136 × 10 3 2 . 740 × 10 4 4 . 483 × 10 5 3 . 9 3 . 3
0.4 5 . 293 × 10 4 3 . 101 × 10 4 6 . 563 × 10 5 0 . 8 1 . 5
0.5 1 . 727 × 10 3 3 . 430 × 10 4 1 . 049 × 10 4 2 . 3 2 . 0
0.6 5 . 522 × 10 4 3 . 787 × 10 4 6 . 581 × 10 5 0 . 5 1 . 5
0.7 5 . 874 × 10 3 4 . 064 × 10 4 8 . 943 × 10 5 3 . 9 3 . 0
0.8 1 . 453 × 10 2 1 . 946 × 10 4 1 . 241 × 10 4 6 . 2 3 . 4
0.9 5 . 871 × 10 2 4 . 198 × 10 3 1 . 931 × 10 5 3 . 8 5 . 7
Table 8. The absolute errors of the function values of y 2 at the knots and the numerical convergence orders.
Table 8. The absolute errors of the function values of y 2 at the knots and the numerical convergence orders.
x i E 0 ( x i , 10 ) E 0 ( x i , 20 ) E 0 ( x i , 40 ) O 0 ( x i , 10 , 20 ) O 0 ( x i , 10 , 40 )
−0.5 1 . 224 × 10 8 9 . 184 × 10 11 7 . 080 × 10 13 7 . 1 7 . 0
−0.4 1 . 748 × 10 9 4 . 632 × 10 12 1 . 765 × 10 14 8 . 6 8 . 2
−0.3 5 . 906 × 10 10 2 . 425 × 10 12 1 . 460 × 10 14 7 . 9 7 . 6
−0.2 3 . 360 × 10 10 2 . 273 × 10 12 5 . 940 × 10 15 7 . 2 7 . 8
−0.1 2 . 934 × 10 10 2 . 220 × 10 12 1 . 117 × 10 14 7 . 0 7 . 3
0.0 2 . 761 × 10 10 2 . 167 × 10 12 6 . 559 × 10 15 7 . 0 7 . 6
0.1 2 . 586 × 10 10 2 . 116 × 10 12 6 . 231 × 10 15 6 . 9 7 . 6
0.2 2 . 150 × 10 10 2 . 057 × 10 12 4 . 469 × 10 15 6 . 7 7 . 7
0.3 4 . 428 × 10 11 1 . 895 × 10 12 4 . 385 × 10 15 4 . 5 6 . 6
0.4 1 . 225 × 10 9 4 . 481 × 10 13 2 . 498 × 10 15 11 . 4 9 . 4
0.5 1 . 194 × 10 8 9 . 321 × 10 11 7 . 356 × 10 13 7 . 0 6 . 9
Table 9. The absolute errors of the first order derivatives of y 2 at the knots and the numerical convergence orders.
Table 9. The absolute errors of the first order derivatives of y 2 at the knots and the numerical convergence orders.
x i E 1 ( x i , 10 ) E 1 ( x i , 20 ) E 1 ( x i , 40 ) O 1 ( x i , 10 , 20 ) O 1 ( x i , 10 , 40 )
−0.5 6 . 342 × 10 7 9 . 518 × 10 9 1 . 470 × 10 10 6 . 0 6 . 0
−0.4 5 . 069 × 10 8 1 . 374 × 10 10 7 . 450 × 10 14 8 . 5 9 . 6
−0.3 9 . 230 × 10 9 4 . 217 × 10 12 2 . 941 × 10 13 11 . 0 7 . 4
−0.2 2 . 200 × 10 9 2 . 199 × 10 12 7 . 871 × 10 14 9 . 9 7 . 3
−0.1 3 . 042 × 10 10 2 . 467 × 10 12 1 . 760 × 10 13 6 . 9 5 . 3
0.0 3 . 641 × 10 10 2 . 618 × 10 12 1 . 416 × 10 13 7 . 1 5 . 6
0.1 3 . 119 × 10 10 2 . 557 × 10 12 5 . 085 × 10 14 6 . 9 6 . 2
0.2 2 . 242 × 10 9 2 . 245 × 10 12 6 . 439 × 10 15 9 . 9 9 . 2
0.3 9 . 406 × 10 9 4 . 439 × 10 12 1 . 124 × 10 13 11 . 0 8 . 1
0.4 5 . 172 × 10 8 1 . 459 × 10 10 4 . 774 × 10 14 8 . 4 10 . 0
0.5 6 . 482 × 10 7 1 . 013 × 10 8 1 . 584 × 10 10 6 . 0 5 . 9
Table 10. The absolute errors of the second order derivatives of y 2 at the knots and the numerical convergence orders.
Table 10. The absolute errors of the second order derivatives of y 2 at the knots and the numerical convergence orders.
x i E 2 ( x i , 10 ) E 2 ( x i , 20 ) E 2 ( x i , 40 ) O 2 ( x i , 10 , 20 ) O 2 ( x i , 10 , 40 )
−0.5 1 . 909 × 10 5 5 . 731 × 10 7 1 . 765 × 10 8 5 . 0 5 . 0
−0.4 1 . 899 × 10 7 1 . 429 × 10 8 4 . 735 × 10 10 3 . 7 4 . 3
−0.3 3 . 931 × 10 7 1 . 135 × 10 8 3 . 656 × 10 10 5 . 1 5 . 0
−0.2 2 . 668 × 10 7 1 . 039 × 10 8 2 . 035 × 10 10 4 . 6 5 . 1
−0.1 2 . 939 × 10 7 9 . 536 × 10 9 1 . 882 × 10 10 4 . 9 5 . 3
0.0 2 . 761 × 10 7 8 . 669 × 10 9 1 . 213 × 10 10 4 . 9 5 . 5
0.1 2 . 583 × 10 7 7 . 801 × 10 9 5 . 797 × 10 11 5 . 0 6 . 0
0.2 2 . 853 × 10 7 6 . 926 × 10 9 2 . 573 × 10 12 5 . 3 8 . 3
0.3 1 . 572 × 10 7 5 . 933 × 10 9 3 . 983 × 10 11 4 . 7 5 . 9
0.4 3 . 659 × 10 7 2 . 799 × 10 9 1 . 204 × 10 10 7 . 0 5 . 7
0.5 2 . 010 × 10 5 6 . 285 × 10 7 1 . 954 × 10 8 4 . 9 5 . 0
Table 11. The absolute errors of the third order derivatives of y 2 at the knots and the numerical convergence orders.
Table 11. The absolute errors of the third order derivatives of y 2 at the knots and the numerical convergence orders.
x i E 3 ( x i , 10 ) E 3 ( x i , 20 ) E 3 ( x i , 40 ) O 3 ( x i , 10 , 20 ) O 3 ( x i , 10 , 40 )
−0.5 3 . 940 × 10 4 2 . 394 × 10 5 1 . 498 × 10 6 4 . 0 4 . 0
−0.4 5 . 180 × 10 5 8 . 104 × 10 7 5 . 789 × 10 10 5 . 9 8 . 2
−0.3 1 . 362 × 10 5 1 . 640 × 10 8 4 . 348 × 10 9 9 . 6 5 . 8
−0.2 3 . 555 × 10 6 2 . 343 × 10 8 2 . 673 × 10 9 7 . 2 5 . 1
−0.1 3 . 114 × 10 7 2 . 567 × 10 8 8 . 109 × 10 11 3 . 6 5 . 9
0.0 7 . 246 × 10 7 2 . 607 × 10 8 2 . 454 × 10 9 4 . 7 4 . 1
0.1 3 . 225 × 10 7 2 . 594 × 10 8 1 . 845 × 10 9 3 . 6 3 . 7
0.2 3 . 624 × 10 6 2 . 396 × 10 8 1 . 008 × 10 9 7 . 2 5 . 9
0.3 1 . 387 × 10 5 1 . 768 × 10 8 2 . 106 × 10 9 9 . 6 6 . 3
0.4 5 . 279 × 10 5 8 . 602 × 10 7 6 . 609 × 10 10 5 . 9 8 . 1
0.5 4 . 043 × 10 4 2 . 555 × 10 5 1 . 637 × 10 6 3 . 9 3 . 9
Table 12. The absolute errors of the fourth order derivatives of y 2 at the knots and the numerical convergence orders.
Table 12. The absolute errors of the fourth order derivatives of y 2 at the knots and the numerical convergence orders.
x i E 4 ( x i , 10 ) E 4 ( x i , 20 ) E 4 ( x i , 40 ) O 4 ( x i , 10 , 20 ) O 4 ( x i , 10 , 40 )
−0.5 5 . 824 × 10 3 7 . 682 × 10 4 1 . 098 × 10 4 2 . 9 2 . 8
−0.4 1 . 743 × 10 3 7 . 014 × 10 5 2 . 500 × 10 5 4 . 6 3 . 0
−0.3 1 . 364 × 10 4 1 . 006 × 10 4 1 . 931 × 10 5 0 . 4 1 . 4
−0.2 6 . 769 × 10 5 8 . 285 × 10 5 1 . 238 × 10 5 0 . 3 1 . 2
−0.1 3 . 940 × 10 4 6 . 240 × 10 5 7 . 654 × 10 6 2 . 6 2 . 8
0.0 3 . 315 × 10 4 4 . 161 × 10 5 2 . 369 × 10 6 2 . 9 3 . 5
0.1 2 . 691 × 10 4 2 . 078 × 10 5 3 . 074 × 10 6 3 . 6 3 . 2
0.2 5 . 980 × 10 4 7 . 186 × 10 8 8 . 315 × 10 6 13 . 0 3 . 0
0.3 5 . 313 × 10 4 1 . 816 × 10 5 1 . 326 × 10 5 4 . 8 2 . 6
0.4 2 . 448 × 10 3 1 . 408 × 10 5 1 . 853 × 10 5 7 . 4 3 . 5
0.5 5 . 332 × 10 3 7 . 329 × 10 4 1 . 119 × 10 4 2 . 8 2 . 7
Table 13. The absolute errors of the fifth order derivatives of y 2 at the knots and the numerical convergence orders.
Table 13. The absolute errors of the fifth order derivatives of y 2 at the knots and the numerical convergence orders.
x i E 5 ( x i , 10 ) E 5 ( x i , 20 ) E 5 ( x i , 40 ) O 5 ( x i , 10 , 20 ) O 5 ( x i , 10 , 40 )
−0.4 2 . 797 × 10 2 2 . 832 × 10 3 1 . 036 × 10 3 3 . 3 2 . 3
−0.3 7 . 801 × 10 3 2 . 489 × 10 4 2 . 683 × 10 4 4 . 9 2 . 4
−0.2 2 . 854 × 10 3 1 . 320 × 10 4 7 . 551 × 10 6 4 . 4 4 . 2
−0.1 3 . 345 × 10 4 2 . 027 × 10 4 3 . 936 × 10 5 0 . 7 1 . 5
0.0 1 . 042 × 10 3 2 . 083 × 10 4 5 . 694 × 10 5 2 . 3 2 . 0
0.1 3 . 340 × 10 4 2 . 081 × 10 4 5 . 359 × 10 5 0 . 7 1 . 3
0.2 2 . 978 × 10 3 2 . 027 × 10 4 4 . 824 × 10 5 3 . 8 2 . 9
0.3 7 . 583 × 10 3 9 . 012 × 10 5 5 . 461 × 10 5 6 . 3 3 . 5
0.4 2 . 765 × 10 2 1 . 876 × 10 3 2 . 563 × 10 5 3 . 8 5 . 0
Table 14. Comparison of the maximum absolute errors of the fifth order derivatives of y 1 .
Table 14. Comparison of the maximum absolute errors of the fifth order derivatives of y 1 .
n = 10 n = 20 n = 40
Current Method 5 . 871 × 10 2 1 . 752 × 10 2 5 . 021 × 10 3
[18] 1 . 365 × 10 1 6 . 794 × 10 2 3 . 427 × 10 2
[19] 3 . 15 × 10 1 1 . 49 × 10 1 7 . 15 × 10 2

Share and Cite

MDPI and ACS Style

Lang, F.-G. A New Quintic Spline Method for Integro Interpolation and Its Error Analysis. Algorithms 2017, 10, 32. https://doi.org/10.3390/a10010032

AMA Style

Lang F-G. A New Quintic Spline Method for Integro Interpolation and Its Error Analysis. Algorithms. 2017; 10(1):32. https://doi.org/10.3390/a10010032

Chicago/Turabian Style

Lang, Feng-Gong. 2017. "A New Quintic Spline Method for Integro Interpolation and Its Error Analysis" Algorithms 10, no. 1: 32. https://doi.org/10.3390/a10010032

APA Style

Lang, F. -G. (2017). A New Quintic Spline Method for Integro Interpolation and Its Error Analysis. Algorithms, 10(1), 32. https://doi.org/10.3390/a10010032

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop