1. Introduction
Assume that
is an unknown univariate real-valued function over
. Let:
be the uniform partition of
with step length
, and let:
be the known integral values of
over the subintervals.
The interpolation function
that satisfies:
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
,
,
,
,
,
and
. 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
,
,
,
and
. 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
,
,
,
and
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
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
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 , .
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
is a function of class
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
at
by using the Taylor formula and computing the integral on
,
, we obtain:
For
, let
,
and
be three parameters, such that:
By using (4) and using these parameters
,
and
,
, as the linear combination coefficients, we obtain:
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:
and:
It is straightforward to prove that:
Let
, by using (
10) and (12); then, we get:
and it holds:
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:
and:
It belongs to the spline space of
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
,
, i.e.,:
where (see, e.g., [
6,
14,
20,
21]):
For the sake of completeness, we give in
Table 1 the values of
at the knots in
. Furthermore, we have the following integro properties:
From (
17) and (23), we have:
Hence, for
, by using (
20)–(22), we get:
Since
, it holds:
The condition
provides the equality:
Similarly, from
, it follows that:
Taking into account that
, we get:
that is:
Finally, from
, it follows that:
Therefore, we get the linear system:
where
and:
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 . Let denote the i-th column and denote the i-th row of a matrix obtained by an elementary row or column transformation.
We first perform elementary column transformations to A.
Step 1: For , .
We continue to perform the following elementary row transformations to .
- Step 2:
;
- Step 3:
, and ;
- Step 4:
, and ;
- Step 5:
, and ;
- Step 6:
, and .
By the basic knowledge of linear algebra, we have:
where
is the central block matrix of
.
is strictly diagonally dominant, and so,
. It implies that
and, hence,
. In other words,
A (
27) is invertible, and the theorem is proven. ☐
Theorem 1 guarantees the existence and uniqueness of the integro quintic spline
determined by (
17)–(
19). It can be constructed as follows:
- (I):
Compute
,
,
,
and
by using (
7)–(9), (11) and (
15), respectively;
- (II):
Solve the system (
26) to get
,
.
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
, we use
to denote
,
. For
, we use
,
,
,
and
to denote
,
. In addition, we define:
in order to approximate
,
. For
,
By using (
24), (
25) and the above results, we can get some important relations between
,
,
,
,
,
and
of the integro quintic spline. We list the relations as follows.
(Set I)
for
,
(Set II)
For
,
for
,
(Set III)
for
,
(Set IV)
for
,
(Set V)
for
,
(Set VI)
for
,
Theorem 2. Let s be the integro quintic spline determined by (17)–(19) with the artificial end conditions given in Section 2. For , we have:For , we have: Proof. We first prove (
43). We define
,
. From (
28) and (
13), we get:
Similarly, from (
30) and (14), it follows that:
Besides, for
, from (
29), it follows that:
Take into account:
we get:
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:
It shows that (
45) holds for
. Similarly, by using (
32) and (
43), we get that (
45) holds for
.
From (
13), it follows that
. By using (
33)–(
35), (
43) and (
45), we get
,
. Therefore, (
42) is proven.
From (
13), it follows that
. Moreover, by using (
37), (
42), (
43) and (
45), we have:
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 , , and full convergence in locally approximating , .
Theorem 3. Let s be the integro quintic spline determined by (17)–(19) with the artificial end conditions given in Section 2; we have:where , and is defined as follows: Proof. By using (
46), for
,
,
where
. Moreover, we have
,
and
,
. Hence,
Next, for
,
,
Hence, we get
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 , .
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:
and:
as two illustrative examples. Furthermore,
will be used in the comparison of our method with some other methods.
The absolute errors at the knots are defined as follows:
and:
The numerical convergence orders of the absolute errors at the knots are defined by:
Table 2,
Table 3,
Table 4,
Table 5,
Table 6 and
Table 7 show the absolute errors
of
at the chosen knots and the numerical convergence orders
, where
,
The results of
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,
and
are of sixth order convergent (see
Table 2,
Table 3,
Table 8 and
Table 9 for the numerical convergence orders),
and
are of fourth order convergent (see
Table 4,
Table 5,
Table 10 and
Table 11 for the numerical convergence orders),
and
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
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:
to approximate
in this paper,
. See
Table 7 and
Table 13 for our numerical results of the fifth order derivatives. Take
as a comparison example. See
Table 14 for the comparison of the maximum absolute errors of the fifth order derivatives
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 (
,
,
,
and
), as well. Hence, our approximation method for the fifth order derivatives at the inner knots is more preferable.