Next Article in Journal
Mathematical Analysis of Fractal-Fractional Mathematical Model of COVID-19
Previous Article in Journal
Octonion Special Affine Fourier Transform: Pitt’s Inequality and the Uncertainty Principles
Previous Article in Special Issue
Fractal Perturbation of the Nadaraya–Watson Estimator
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Reproducing Kernel Hilbert Spaces of Smooth Fractal Interpolation Functions

Department of Data Science and Analytics, I-Shou University, No. 1, Sec. 1, Syuecheng Road, Dashu District, Kaohsiung City 84001, Taiwan
*
Author to whom correspondence should be addressed.
Fractal Fract. 2023, 7(5), 357; https://doi.org/10.3390/fractalfract7050357
Submission received: 3 March 2023 / Revised: 23 April 2023 / Accepted: 25 April 2023 / Published: 27 April 2023

Abstract

:
The theory of reproducing kernel Hilbert spaces (RKHSs) has been developed into a powerful tool in mathematics and has lots of applications in many fields, especially in kernel machine learning. Fractal theory provides new technologies for making complicated curves and fitting experimental data. Recently, combinations of fractal interpolation functions (FIFs) and methods of curve estimations have attracted the attention of researchers. We are interested in the study of connections between FIFs and RKHSs. The aim is to develop the concept of smooth fractal-type reproducing kernels and RKHSs of smooth FIFs. In this paper, a linear space of smooth FIFs is considered. A condition for a given finite set of smooth FIFs to be linearly independent is established. For such a given set, we build a fractal-type positive semi-definite kernel and show that the span of these linearly independent smooth FIFs is the corresponding RKHS. The nth derivatives of these FIFs are investigated, and properties of related positive semi-definite kernels and the corresponding RKHS are studied. We also introduce subspaces of these RKHS which are important in curve-fitting applications.

1. Introduction

The basic theory of reproducing kernel Hilbert spaces (RKHSs) was studied by Aronszajn [1], and it has been developed to be a powerful tool in operator theory, differential equations, integral equations, probability, statistics, and learning theory. See the excellent monographs [2,3,4,5,6,7] and references therein. Nowadays, learning algorithms in RKHSs play an important role in the development of machine learning. A linear model that can only be formulated as an inner product can be transformed into a nonlinear model by replacing the inner product with a symmetric positive semi-definite kernel. We use a kernel to map input data implicitly into a high-dimensional feature space to improve the performance of a learning algorithm. This is a widely used principle called the “kernel trick”. In many applications, data are arising from unknown functions, and it is required to generate a function to interpolate or approximate these data. The concept of RKHSs has been widely applied to such regression problems.
Various types of functions, such as polynomials, splines, rational functions, trigonometric functions, and wavelets have been widely-used in real-world data-fitting. However, sampled signals may have irregular forms in many practical problems, and fractal theory provides new technologies for making complicated curves and fitting experimental data. The theory of fractal interpolation functions (FIFs) is developed for the interpolation problem with a class of fractal functions. It generalizes traditional interpolation techniques through the property of self-similarity. The concept of FIFs defined through an iterated function system was introduced by Barnsley [8,9]. See also these books [10,11,12] for developments of the theory of FIFs and their applications.
Smooth FIFs have also been discussed by many authors. A construction of C p -FIFs was given in [13]. Based on this work, C p -Hermite FIFs were obtained in [14,15], C 2 -cubic spline FIFs were discussed in [16], and smooth rational cubic FIFs were investigated in [17,18,19,20]. Error bounds, shape-preserving properties, and parameter identification of smooth FIFs have been extensively discussed in the literature.
In [21,22,23], linear FIFs and recurrent linear FIFs were applied to model discrete sequences. In [24], estimations in RKHSs with dependent data were investigated. Recently, the combination of FIFs and other types of curve estimations has attracted the attention of researchers. In [25], the authors studied a fractal perturbation of a type of nonparametric curve estimation. In [26], a training set of samples was used to train an SVM model, and then a linear FIF was constructed based on the predicted data of SVM. In [27], fractal-type reproducing kernels and RKHSs of fractal functions were established. In [28], the author showed that a set of FIFs is an RKHS under two different types of inner products, and then apply such RKHSs to curve-fitting problems. Through the work given in [27,28], connections between FIFs and RKHSs are clearer and we see a new direction of research in the theory of FIFs and RKHSs. Since smooth FIFs have been studied by many researchers, it is natural to develop the concept of RKHSs of smooth FIFs. The purpose of this paper is to construct smooth fractal-type reproducing kernels and RKHSs of smooth FIFs.
Throughout this paper, let t 0 , t 1 , , t N be a given set of real numbers such that t 0 < t 1 < t 2 < < t N , where N is a positive integer and N 2 , and let I = t 0 ,   t N , For each i = 1 ,   ,   N , let I i = t i 1 ,   t i . We will denote by C I the set of all real-valued continuous functions defined on I . Define f = max t I f t for f C I . For a nonnegative integer p , let C p I denote the space of all real-valued functions whose p th derivatives exist and are continuous on I . We also denote C p I by C I in the case p = 0 .
This paper is structured as follows. In Section 2, we give a brief introduction to the construction of smooth FIFs by the approach given in [13]. For given numbers t 0 ,   t 1 ,   ,   t N and a nonnegative integer p , a class of FIFs in C p I is established. In Section 3, suppose that t 0 ,   ,   t N and p are fixed, and all vertical scaling factors in the construction of FIFs are also fixed numbers. We consider a linear space of smooth FIFs since linear combinations of smooth FIFs are also smooth FIFs. A condition for a set of smooth FIFs B = ψ 1 ,   ,   ψ m to be linearly independent is given. Then we establish a fractal-type positive semi-definite kernel k by functions in B , and show that F B = span ψ 1 ,   ,   ψ m is a RKHS with the reproducing kernel k . A subspace H of F B , which is important in curve fitting problems, is considered. To investigate the space of n th derivatives of functions in F B , we consider the space F B n = span ψ 1 n ,   ,   ψ m n and show that F B n is a RKHS with a reproducing kernel defined by ψ 1 n ,   ,   ψ m n , where ψ i n is the n th derivative of ψ i . Two subspaces of F B n , H n and n , are considered. We investigate connections between H n and n , and prove that if the ranks of ψ l t i and ψ l n t i are both equal to m , then H n = n . Hence for any function f in H , we have two equivalent representations for the n th derivative of f .

2. Construction of Smooth Fractal Interpolation Functions

The construction of smooth FIFs given here has been treated in [13]. We show the details here to make our paper more self-contained.
Let p be a nonnegative integer. For i = 1 , , N , suppose q i C P I , and define L i = I I i and M i I × by
L i t = t i t i 1 t N t 0 t + t N t i 1 t 0 t i t N t 0 ,
M i t , y = s i y + q i t .
Here s 1 , , s N 1 , 1 , and these numbers are called vertical scaling factors. Assume that
s i < a i p ,           where   a i = t i t i 1 t N t 0 .
We also define
F i , n t , y = s i y + q i n t a i n ,           y 0 , n = q 1 n t 0 a 1 n s 1 ,           y N , n = q N n t N a N n s N ,
for i = 1 , , N , and n = 0 ,   1 ,   ,   p . Here q i n is the n th derivative of q i and q i 0 = q i .
In the case n = 0 , F i ,   0 = M i , and it is proved in ([8] Theorem 1) that if
F 1 ,   0 t 0 ,   y 0 , 0 = y 0 , 0 ,   F N ,   0 t N ,   y N , 0 = y N , 0 ,
and
F i 1 ,   0 t N ,   y N , 0 = F i ,   0 t 0 ,   y 0 , 0   hold   for   i = 2 , , N ,
then L i t ,   M i t ,   y i = 1 ,   ,   N determines a FIF f C I . We call f a FIF corresponding to the set of scaling factors and functions s i ; q i   i = 1 ,   ,   N . Moreover, the obtained FIF f satisfies f t 0 = y 0 , 0 ,   f t N = y N , 0 , and
f t i = y i ,   where   y i = s i y N , 0 + q i t N ,   i = 1 ,   ,   N 1 .
In the case p 1 , it is proved in ([13] Theorem 2) that if
F i 1 , n t N ,   y N , n = F i ,   n t 0 ,   y 0 , n ,             i = 2 ,   ,   N ,           n = 1 ,   ,   p ,
then L i t ,   M i t ,   y i = 1 ,   ,   N determines a FIF f C p I , and f n is the FIF determined by L i t ,   F i , n t ,   y i = 1 ,   ,   N for n = 1 ,   ,   p . Moreover, for n = 0 ,   1 ,   ,   p ,
f n t = 1 a i n s i f n L i 1 t + q i n L i 1 t ,           t I i ,           i = 1 ,   ,   N .
We see that f n is a FIF corresponding to the set s i a i n ; q i n a i n i = 1 ,   ,   N .
By F i ,   0 = M i and Equation 2 , conditions F 1 ,   0 t 0 ,   y 0 , 0 = y 0 , 0 and F N ,   0 t N ,   y N , 0 = y N , 0 imply that
y 0 , 0 = q 1 t 0 1 s 1   and   y N , 0 = q N t N 1 s N ,
which are consistent with that given in Equation 4 with n = 0 . The conditions F i 1 ,   0 t N ,   y N , 0 = F i ,   0 t 0 ,   y 0 , 0 for i = 2 , , N can be reduced to
s i 1 1 s N q N t N + q i 1 t N = s i 1 s 1 q 1 t 0 + q i t 0 ,           i = 2 ,   ,   N .
By Equation   4 , condition Equation 5 can be reduced to
s i 1 q N n t N + a N n s N q i 1 n t N a i 1 n a N n s N = s i q 1 n t 0 + a 1 n s 1 q i n t 0 a i n a 1 n s 1
for i = 2 ,   ,   N and n = 1 ,   ,   p . Note that in the case n = 0 , Equation 8 is reduced to Equation 7 .

3. Reproducing Kernel Hilbert Spaces of Smooth Fractal Interpolants

Throughout this section, suppose that p is a fixed nonnegative integer, N 2 is a fixed positive integer, and t 0 ,   ,   t N , s 1 ,   ,   s N are all fixed numbers. Let L 1 ,   ,   L N be given by Equation 1 .

3.1. Linear Spaces of FIFs and a Condition for Linearly Independent FIFs

Suppose that F p is a set of functions in C p I such that each f in F p is a C p -FIF corresponding to a set s i ; q i   i = 1 ,   ,   N , where each q i is a function in C p I , and Equation 8 holds for i = 2 ,   ,   N and n = 0 ,   1 ,   ,   p . By the results given in Section 2 and Equation 6 , we see that f n is a FIF corresponding to the set s i a i n ; q i n a i n i = 1 ,   ,   N .
Proposition 1.
F p is a linear space.
Proof. 
It is easy to see that the zero function is in F p with q i 0 for each i . Suppose f , g F p . Then f and g are C p -FIFs corresponding to the sets s i ; q i   i = 1 ,   ,   N and s i ; r i   i = 1 ,   ,   N , respectively, where q i , r i C p I for i = 1 ,   ,   N , and satisfy Equation 8 . Therefore, for n = 0 ,   1 ,   ,   p and i = 1 ,   ,   N ,
f n t = 1 a i n s i f n L i 1 t + q i n L i 1 t ,           t I i ,
g n t = 1 a i n s i g n L i 1 t + r i n L i 1 t ,           t I i ,
and the following conditions hold for i = 2 ,   ,   N and n = 0 ,   1 ,   ,   p :
s i 1 q N n t N + a N n s N q i 1 n t N a i 1 n a N n s N = s i q 1 n t 0 + a 1 n s 1 q i n t 0 a i n a 1 n s 1 ,
s i 1 r N n t N + a N n s N r i 1 n t N a i 1 n a N n s N = s i r 1 n t 0 + a 1 n s 1 r i n t 0 a i n a 1 n s 1 .
Let a ,   b . Then a f + b g satisfies
a f + b g n t = 1 a i n s i a f + b g n L i 1 t + a q i + b r i n L i 1 t ,           t I i ,
for n = 0 ,   1 ,   ,   p and i = 1 ,   ,   N . Here a q i + b r i C p I and satisfies
s i 1 a q N + b r N n t N + a N n s N a q i 1 + b r i 1 n t N a i 1 n a N n s N = s i a q 1 + b r 1 n t 0 + a 1 n s 1 a q i + b r i n t 0 a i n a 1 n s 1
for i = 2 ,   ,   N and n = 0 ,   1 ,   ,   p . Therefore a f + b g F p and is corresponding to the set s i ; a q i + b r i   i = 1 ,   ,   N . Moreover, a f n + b g n is a FIF corresponding to the set s i a i n ; a q i n + b r i n a i n i = 1 ,   ,   N . □
When considering a subspace of F p , we are usually interested in a set of linearly independent functions in F p . Each FIF in F p is defined by Equation 6 and is not given in an explicit form. To determining whether a set of FIFs is linearly independent may not be a trivial task. Here we investigate this problem. Let m be a positive integer. Suppose that, for j = 1 ,   ,   m , f j F p and is corresponding to the set s i ; q j i   i = 1 ,   ,   N , where Equation 8 holds with q i being replaced by q j i , i = 1 ,   ,   N . In the following, we give a condition for f 1 ,   ,   f m to be linearly independent.
Proposition 2.
If  q 1 i ,   ,   q m i  are linearly independent on  I  for some  i = 1 ,   ,   N , then  f 1 ,   ,   f m  are linearly independent on  I .
Proof. 
For a 1 ,   ,   a m , j = 1 m a j f j is in F p and is corresponding to the set s i ; j = 1 m a j q j i i = 1 ,   ,   N . By Equation 13 with n = 0 , we see that j = 1 m a j f j also satisfies
j = 1 m a j f j t = s i j = 1 m a j f j L i 1 t + j = 1 m a j q j i L i 1 t ,           t I i
for i = 1 ,   ,   N .
If f 1 ,   ,   f m are linearly dependent on I , then there exist a 1 ,   ,   a m , not all zero, such that j = 1 m a j f j 0 on I . This implies j = 1 m a j q j i 0 on I and hence q 1 i ,   ,   q m i are linearly dependent on I for each i = 1 ,   ,   N . Therefore, if q 1 i ,   ,   q m i are linearly independent on I for some i = 1 ,   ,   N , then we have a set of linearly independent FIFs f 1 ,   ,   f m on I . □
Similarly, we have
j = 1 m a j f j n t = 1 a i n s i j = 1 m a j f j n L i 1 t + j = 1 m a j q j i n L i 1 t
for t I i , i = 1 ,   ,   N . If q 1 i n ,   ,   q m i n are linearly independent on I for some i = 1 ,   ,   N , then f 1 n ,   ,   f m n are linearly independent on I .

3.2. Fractal-Type Positive Semi-Definite Kernels and RKHSs of FIFs

Suppose that an inner product · , · on C I is defined. Let m be a positive integer. Let B = ψ 1 ,   ,   ψ m , where each ψ j F p is a FIF corresponding to a set s i ; q j i   i = 1 ,   ,   N , where Equation 8 holds with q i being replaced by q j i ,   i = 1 ,   ,   N . Suppose that q 1 i ,   ,   q m i are linearly independent on I for some i . Then by Proposition 2, ψ 1 ,   ,   ψ m are linearly independent on I . Let
F B = span ψ 1 ,   ,   ψ m .
Then F B is a finite-dimensional Hilbert space with a basis B . Let A = ψ i ,   ψ j . By ([6] Proposition 2.23), we see that A is a positive definite matrix and hence A is invertible.
Define
k 𝓌 ,   t = j = 1 m l = 1 m ψ j 𝓌 ψ l t B j ,   l ,           𝓌 ,   t I ,
where the matrix B = B j ,   l is the inverse of A . The following theorem shows that F B is a reproducing kernel Hilbert space and k is the reproducing kernel. Similar results can be found in [27,28].
Proposition 3.
The function  k  defined by Equation  14  is positive semi-definite. The space  F B  is a finite-dimensional reproducing kernel Hilbert space with the reproducing kernel  k .
Proof. 
Since B is symmetric, let B 1 / 2 be the matrix such that B 1 / 2 B 1 / 2 = B . Let n be any positive integer and let z 1 ,   ,   z n be any choice of distinct points in I . Let Ψ = ψ j z r . Then for any column vector c = c 1 ,   ,   c n T in n ,
i = 1 n r = 1 n c i c r k z i ,   z r = c T Ψ T B Ψ c = B 1 / 2 Ψ c T B 1 / 2 Ψ c 0 .
This shows that k is positive semi-definite.
Let k t · = k · ,   t and we write k t in the form
k t · = j = 1 m l = 1 m ψ l t B j ,   l ψ j · .
Then for f = i = 1 m a i ψ i F B and t I ,
f ,   k t = i = 1 m j = 1 m a i l = 1 m ψ l t B j ,   l ψ i ,   ψ j
= i = 1 m l = 1 m a i ψ l t j = 1 m A i ,   j B j ,   l = i = 1 m a i ψ i t = f t .
We also have k 𝓌 ,   t = k t 𝓌 = k t ,   k 𝓌 for t ,   𝓌 I .
By Equation 15 with t = t 0 ,   ,   t N , we have
k t i = j = 1 m l = 1 m ψ l t i B j ,   l ψ j ,           i = 0 ,   1 ,   ,   N .
Define:
H = span k t 0 ,   k t 1 ,   ,   k t N .
It is easy to see that H F B . In fact, for f H , we can write f in the form f = i = 0 N α i k t i and then by Equation 17 ,
f = i = 0 N α i j = 1 m l = 1 m ψ l t i B j ,   l ψ j = j = 1 m i = 0 N l = 1 m α i ψ l t i B j ,   l ψ j F B .
The following well-known result shows the role of the subspace H . □
Proposition 4.
For any  g F B , there exists a function  f H  such that  f t i = g t i  for  i = 0 ,   1 ,   ,   N , and  f g .
Proof. 
For g F B , let P H g be the orthogonal projection of g on H . Then g P H g is orthogonal to the subspace H . By Equation 16 with t = t i , i = 0 ,   1 ,   ,   N , we have
g t i P H g t i = g P H g ,   k t i = 0 .
This proposition is proved by choosing f = P H g . □
For g F B , g 2 = g , g . If f is a function in H , then f 2 can be represented by k . We write f H in the form f = i = 0 N α i k t i , then
f 2 = i = 0 N α i k t i ,   j = 0 N α j k t j = i = 0 N j = 0 N α i α j k t j ,   t i .

3.3. RKHSs Defined by the Derivatives of Functions in B

In Section 3.2, we establish a positive semi-definite kernel k by a set of linearly independent functions ψ 1 ,   ,   ψ m in F p , and show that the span of these functions is a reproducing kernel Hilbert space and k is the reproducing kernel. Since all ψ i are functions in C p I and derivatives of ψ i are still FIFs, it is quite nature to investigate those RKHSs which are spanned by the derivatives of ψ 1 ,   ,   ψ m .
Suppose p 1 and 1 n p . If q 1 i n ,   ,   q m i n are linearly independent on I for some i , then ψ 1 n ,   ,   ψ m n are linearly independent on I . Let B n = ψ 1 n ,   ,   ψ m n and
F B n = span ψ 1 n ,   ,   ψ m n .
Each ψ j n is a FIF corresponding to the set s i a i n ; q j i n a i n   i = 1 ,   ,   N . Define
D n k 𝓌 ,   t = j = 1 m l = 1 m ψ j n 𝓌 ψ l n t B j , l n ,           t ,   t I ,
where the matrix B n = B j ,   l n is the inverse of the matrix A n = ψ i n ,   ψ j n . We see that D n k 𝓌 ,   t = 2 n 𝓌 n t n k 𝓌 ,   t . By a similar approach given in the proof of Theorem 3, we see that D n k is positive semi-definite and we can write D n k t in the form
D n k t · = j = 1 m l = 1 m ψ l n t B j , l n ψ j n · .
For g = i = 1 m α i ψ i n F B n and for t I ,
g ,   D n k t = i = 1 m j = 1 m α i l = 1 m ψ l n t B j , l n ψ i n ,   ψ j n
= i = 1 m l = 1 m α i ψ l n t j = 1 m A i , j n B j ,   l n = i = 1 m α i ψ i n t = g t .
Therefore, we have the following theorem.
Proposition 5.
The space  F B n  is a finite-dimensional reproducing kernel Hilbert space with the reproducing kernel  D n k  defined by Equation  19 .
By Equation 20 with t = t 0 ,   ,   t N , we have
D n k t i · = j = 1 m l = 1 m ψ l n t i B j , l n ψ j n · ,           i = 1 ,   ,   N .
Define
H n = span D n k t 0 ,   D n k t 1 , , D n k t N .
It is easy to see that H n F B n . In fact, for h H n , we can write h = i = 0 N α i D n k t i and then
h = i = 0 N α i j = 1 m l = 1 m ψ l n t i B j , l n ψ j n = j = 1 m i = 0 N l = 1 m α i ψ l n t i B j , l n ψ j n F B n .
The following result shows the role of the subspace H n .
Proposition 6.
For any  h F B n , there exists a function  u H n  such that  u t i = h t i  for  i = 0 ,   1 ,   ,   N , and  u h .
Proof. 
For h F B n , let P H n be the orthogonal projection of h on H n . Then h P H n h is orthogonal to the subspace H n . By Equation 21 with t = t i , i = 0 ,   1 ,   ,   N , we have
h t i P H n h t i = h P H n h , D n k t i = 0 .
This proposition is proved by choosing u = P H n h . □
If u is a function in H n , then u 2 can be represented by D n k . For u H n , we write u as the form u = i = 0 N β i D n k t i , and then
u 2 = i = 0 N β i D n k t i ,   j = 0 N β j D n k t j = i = 0 N j = 0 N β i β j D n k t j , t i .
A function f in H = span k t 0 ,   k t 1 ,   ,   k t N can be written as the form f = i = 0 N α i k t i . We have f n = i = 0 N α i k t i n , where k t i n is the n th derivative of k t i defined by Equation 17 and it can be written as
k t i n = j = 1 m l = 1 m ψ l t i B j ,   l ψ j n ,           i = 0 ,   1 ,   ,   N .
Since f n is a linear combination of k t 0 n , k t 1 n , , k t N n , it is natural to consider the space
n = span k t 0 n ,   k t 1 n ,   ,   k t N n
when we discuss the n th derivative f n of f H . Recall that H n = span D n k t 0 ,   D n k t 1 , , D n k t N . Is the subspace H n identical to the subspace n ? We discuss this question below. Here both sets of functions ψ 1 ,   ,   ψ m   and ψ 1 n ,   ,   ψ m n are supposed to be linearly independent.
We first consider functions in n H n . Suppose h n H n . We can write
h = i = 0 N α i k t i n = i = 0 N β i D n k t i .
Then by Equations 24 and 22 ,
h = j = 1 m i = 0 N l = 1 m α i ψ l t i B j ,   l ψ j n = j = 1 m i = 0 N l = 1 m β i ψ l n t i B j , l n ψ j n .
Since ψ 1 n ,   ,   ψ m n are linearly independent on I , we have
i = 0 N l = 1 m ψ l t i B j ,   l α i = i = 0 N l = 1 m ψ l n t i B j , l n β i ,           j = 1 ,   ,   m .
The system Equation 26 can be written in the matrix form
B Ψ t α = B n Ψ n t β ,  
where α = α 0 ,   ,   α N T , β = β 0 ,   ,   β N T , and Ψ t , Ψ n t are m × N + 1 matrices ψ l t i , ψ l n t i , respectively. Here B = B j ,   l is given in Equation 14 and B n = B j ,   l n is given in Equation 19 . Hence h n H n if and only if there exist vectors α and β that satisfy Equation 27 , and in this case, h is given by Equation 25 .
Since B is invertible, we have
Ψ t α = B 1 B n Ψ n t β .  
If the rank of Ψ t is equal to m , then this equation is consistent for any vector β . Conversely, since B n is also invertible, Equation 27 implies that
B n 1 B Ψ t α = Ψ n t β .  
If the rank of Ψ n t is equal to m , then this equation is consistent for any vector α . We have the following theorem.
Proposition 7.
If the ranks of  Ψ t  and  Ψ n t  are both equal to  m , then  n = H n .
Proof. 
For any h H n , we write h in the form h = i = 0 N β i D n k t i . If the rank of Ψ t is equal to m , then by setting β = β 0 ,   ,   β N T , the Equation 28 has a solution α = α 0 ,   ,   α N T , and h can be written as h = i = 0 N α i k t i n n . This shows that H n n . Conversely, for any h n , we write h in the form h = i = 0 N α i k t i n . If the rank of Ψ n t is equal to m , then by setting α = α 0 ,   ,   α N T , the Equation 29 has a solution β = β 0 ,   ,   β N T , and h can be written as h = i = 0 N β i D n k t i H n . This implies that n H n . □
For f H , we write f = i = 0 N α i k t i and f n = i = 0 N α i k t i n n . If β is a solution of Equation 27 , then we can write f n = i = 0 N β i D n k t i H n and
f n 2 = i = 0 N j = 0 N β i β j D n k t j ,   t i .
We can investigate the relationship between k t j n and D n k t i by Equation 27 . If α is the vector such that α δ = 1 and α i = 0 for i δ , where 0 δ N , then the left-hand side of Equation 27 is reduced to the δ -th column of the matrix B Ψ t , and if β is a solution of Equation 27 , then
k t δ n = i = 0 N β i D n k t i .
If β is the vector such that β δ = 1 and β i = 0 for i δ , where 0 δ N , then the right-hand side of Equation 27 is reduced to the δ -th column of the matrix B n Ψ n t , and if α is a solution of Equation 27 , then
D n k t δ = i = 0 N α i k t i n .
Consider the particular case m = N + 1 . If the ranks of Ψ t and Ψ n t are both equal to N + 1 , then Ψ t and Ψ n t are both invertible. By Equation 27 ,
α = Ψ t 1 B 1 B n Ψ n t β   for   any   vector   β , β = Ψ n t 1 B n 1 B Ψ t α   for   any   vector   α .

4. Conclusions

The theory of RKHSs and the concept of FIFs play important roles in mathematics and have variety of applications in many fields. The work given in [27,28] bridged the gap between RKHSs and FIFs. In this paper we study RKHSs of smooth FIFs f and their n th derivatives f n .
First, a linear space F p of C p -FIF is established. Then we consider a linearly independent set of functions B = ψ 1 ,   ,   ψ m in F p . A condition for the independent property of functions in B is established. We show that the space F B = span ψ 1 ,   ,   ψ m is a finite-dimensional RKHS with the reproducing kernel k defined by Equation 14 . Define H = span k t 0 ,   k t 1 ,   ,   k t N , which is a subspace of F B and plays an important role in curve fitting applications. If f is a function in H , then f 2 can be represented by k .
To investigate the RKHS of n th derivatives of functions in F B , we define B n = ψ 1 n ,   ,   ψ m n and F B n = span ψ 1 n ,   ,   ψ m n . F B n is a finite-dimensional RKHS with the reproducing kernel D n k defined by Equation 19 . For f H , f n n = span k t 0 n ,   k t 1 n ,   ,   k t N n . We also define a subspace H n of F B n , where H n = span D n k t 0 ,   D n k t 1 , , D n k t N . We prove that if the ranks of Ψ t and Ψ n t are both equal to m , then n = H n . Here Ψ t = ψ l t i and Ψ n t = ψ l n t i are both m × N + 1 matrices. If f is a function in H , then f n 2 can be represented by D n k . Note that f n can be represented by D n k t 0 ,   D n k t 1 , , D n k t N and also by k t 0 n ,   k t 1 n ,   ,   k t N n , the two representations are connected by the Formula 27 . Moreover, it is clear to write each D n k t i as a linear combination of k t 0 n ,   k t 1 n ,   ,   k t N n , and to write each k t i n as a linear combination of D n k t 0 ,   D n k t 1 , , D n k t N .
In this paper we establish a finite-dimensional RKHS spanned by a set of linearly independent FIFs, and the RKHS spanned by the n th derivatives of these basis functions. An important subspace H is introduced, and the subspace of the n th derivative of f in H is investigated. We believe that results established in this paper enrich the theory of RKHSs and FIFs, and may have applications in many fields.

Author Contributions

Conceptualization, D.-C.L. and L.-Y.H.; methodology, D.-C.L.; validation, L.-Y.H.; formal analysis, L.-Y.H.; investigation, D.-C.L.; resources, L.-Y.H.; writing—original draft preparation, D.-C.L.; writing—review and editing, L.-Y.H.; visualization, L.-Y.H.; supervision, D.-C.L.; project administration, D.-C.L. and L.-Y.H.; funding acquisition, D.-C.L. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Ministry of Science and Technology, R.O.C., under Grant MOST 110-2115-M-214-002.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

References

  1. Aronszajn, N. Theory of reproducing kernels. Trans. Am. Math. Soc. 1950, 68, 337–404. [Google Scholar] [CrossRef]
  2. Vapnik, V.N. Statistical Learning Theory; Wileys: New York, NY, USA, 1998. [Google Scholar]
  3. Berlinet, A.; Thomas-Agnan, C. Reproducing Kernel Hilbert Spaces in Probability and Statistics; Springer: New York, NY, USA, 2004. [Google Scholar]
  4. Rasmussen, C.E.; Williams, C.K.I. Gaussian Processes of Machine Learning; MIT Press: Cambridge, MA, USA, 2006. [Google Scholar]
  5. Cucker, F.; Zhou, D.X. Learning Theory: An Approximation Theory Viewpoint; Cambridge University Press: New York, NY, USA, 2007. [Google Scholar]
  6. Paulsen, V.I.; Raghupathi, M. An Introduction to the Theory of Reproducing Kernel Hilbert Spaces; Cambridge University Press: Cambridge, UK, 2016. [Google Scholar]
  7. Pereverzyev, S. An Introduction to Artificial Intelligence Based on Reproducing Kernel Hilbert Spaces; Birkhäuser: Cham, Switzerland, 2022. [Google Scholar]
  8. Barnsley, M.F. Fractal functions and interpolation. Constr. Approx. 1986, 2, 303–329. [Google Scholar] [CrossRef]
  9. Barnsley, M.F. Fractals Everywhere; Academic Press: Orlando, FL, USA, 1988. [Google Scholar]
  10. Massopust, P.R. Fractal Functions, Fractal Surfaces, and Wavelets; Academic Press: San Diego, CA, USA, 2004. [Google Scholar]
  11. Massopust, P.R. Interpolation and Approximation with Splines and Fractals; Oxford University Press: New York, NY, USA, 2010. [Google Scholar]
  12. Banerjee, S.; Gowrisankar, A. Frontiers of Fractal Analysis Recent Advances and Challenges; CRC Press: Boca Raton, FL, USA, 2022. [Google Scholar]
  13. Barnsley, M.F.; Harrington, A.N. The calculus of fractal interpolation functions. J. Approx. Theory 1989, 57, 14–34. [Google Scholar] [CrossRef] [Green Version]
  14. Chand, A.K.B.; Navascués, M.A. Generalized Hermite fractal interpolation. Rev. R. Acad. Cienc. Zaragoza 2009, 64, 107–120. [Google Scholar]
  15. Navascués, M.A.; Sebastián, M.V. Generalization of Hermite functions by fractal interpolation. J. Approx. Theory 2004, 131, 19–29. [Google Scholar] [CrossRef] [Green Version]
  16. Chand, A.K.B.; Kapoor, G.P. Generalized cubic spline fractal interpolation functions. SIAM J. Numer. Anal. 2006, 44, 655–676. [Google Scholar] [CrossRef] [Green Version]
  17. Balasubramani, N. Shape preserving rational cubic fractal interpolation function. J. Comput. Appl. Math. 2017, 319, 277–295. [Google Scholar] [CrossRef]
  18. Balasubramani, N.; Prasad, M.G.P.; Natesan, S. Shape preserving α-fractal rational cubic splines. Calcolo 2020, 57, 21. [Google Scholar] [CrossRef]
  19. Viswanathan, P.; Chand, A.K.B. A fractal procedure for monotonicity preserving interpolation. Appl. Math. Comput. 2014, 247, 190–204. [Google Scholar] [CrossRef]
  20. Viswanathan, P.; Chand, A.K.B.; Agarwal, R.P. Preserving convexity through rational cubic spline fractal interpolation function. J. Comput. Appl. Math. 2014, 263, 262–276. [Google Scholar] [CrossRef]
  21. Mazel, D.S.; Hayes, M.H. Using iterated function systems to model discrete sequences. IEEE Trans. Signal Process. 1992, 40, 1724–1734. [Google Scholar] [CrossRef]
  22. Mazel, D.S. Representation of discrete sequences with three-dimensional iterated function systems. IEEE Trans. Signal Process. 1994, 42, 3269–3271. [Google Scholar] [CrossRef]
  23. Marvasti, M.A.; Strahle, W.C. Fractal geometry analysis of turbulent data. Signal Process. 1995, 41, 191–201. [Google Scholar] [CrossRef]
  24. Sancetta, A. Estimation in reproducing kernel Hilbert spaces with dependent data. IEEE Trans. Inform. Theory 2021, 67, 1782–1795. [Google Scholar] [CrossRef]
  25. Luor, D.-C.; Liu, C.-W. Fractal perturbation of the Nadaraya-Watson estimator. Fractal Fract. 2022, 6, 680. [Google Scholar] [CrossRef]
  26. Wang, H.-Y.; Li, H.; Shen, J.-Y. A novel hybrid fractal interpolation-SVM model for forecasting stock price indexes. Fractals 2019, 27, 1950055. [Google Scholar] [CrossRef]
  27. Bouboulis, P.; Mavroforakis, M. Reproducing kernel Hilbert spaces and fractal interpolation. J. Comput. Appl. Math. 2011, 235, 3425–3434. [Google Scholar] [CrossRef] [Green Version]
  28. Luor, D.-C. Reproducing kernel Hilbert spaces of fractal interpolation functions for curve fitting problems. Fractals 2022, 30, 2250037. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Luor, D.-C.; Hsieh, L.-Y. Reproducing Kernel Hilbert Spaces of Smooth Fractal Interpolation Functions. Fractal Fract. 2023, 7, 357. https://doi.org/10.3390/fractalfract7050357

AMA Style

Luor D-C, Hsieh L-Y. Reproducing Kernel Hilbert Spaces of Smooth Fractal Interpolation Functions. Fractal and Fractional. 2023; 7(5):357. https://doi.org/10.3390/fractalfract7050357

Chicago/Turabian Style

Luor, Dah-Chin, and Liang-Yu Hsieh. 2023. "Reproducing Kernel Hilbert Spaces of Smooth Fractal Interpolation Functions" Fractal and Fractional 7, no. 5: 357. https://doi.org/10.3390/fractalfract7050357

Article Metrics

Back to TopTop