1. Introduction
The concept of a fractal interpolation function, or FIF for short, introduced by Barnsley in [
1] gained a lot of attention from researchers and has been intensively studied in recent years; see, for instance, [
2,
3,
4,
5,
6,
7,
8,
9]. The interest in this type of interpolation is motivated by the significant applicability of fractal interpolation to model real-life data. FIFs have various applications, among which we mention curve fitting (see [
10]), image data reconstruction (see [
11]), image compression (see [
12]), reconstruction of epidemic curves (see [
13]) and others.
Nowadays, the development of technology, digital transformation and data science make artificial intelligence a basic tool in engineering and in the treatment and processing of complicated systems that involve a huge quantity of inputs and outputs. The relation between artificial intelligence and fractal geometry has two aspects: how to deal with data owning a self-similar structure, and how to add fractal characteristics to the models in order to capture hidden structures not well fitted by Euclidean objects (see [
14,
15], for instance). There are interesting contributions linking fractal geometry and artificial intelligence to modern scientific and technological fields, such as image encoding ([
16]), wind speed fluctuation ([
17]), concrete crack ([
18]), fractal antennas ([
19]), surface roughness ([
20]), etc. One of the main fields of application of artificial intelligence is health diagnoses, where bioelectric signals play an essential role. This kind of data shows an unequivocal fractal character, reported by a huge quantity of bibliographical references. For the processing of these computerized data, fractal functions are a key tool. This fact makes the development of the theory of fractal maps a must in order to understand the rich self-similar structure of the recorded data. Our work follows this need, enlarging the field of the now classic fractal interpolation. The article we present constructs a more general model for the iterated function system involved in the definition of a fractal interpolant. Thus, the schematic scaling term in the
y-ordinate, is replaced by a more general contraction. The model we present here provides a wider framework for dealing with fractal interpolation of data, enlarging the possibilities of this methodology.
In [
21], Navascués proved that for any continuous function
f defined on a compact interval, there can be a family of fractal interpolation functions
associated that interpolate and approximate
f, thus obtaining
-fractal functions, which pioneered a novel direction for research. Various properties of the
-fractal function have been studied (see [
22,
23,
24] et al.) and several extensions of the
-fractal functions were introduced, among which we mention variable scaling factors
-FIFs, hidden-variable, etc. (see, for instance, [
25,
26,
27,
28,
29]).
A recent direction of research to obtain more general FIF is to replace the classical Banach contraction principle with more relaxed fixed point results, thus obtaining a wider spectrum of FIFs. In this respect, the reader is encouraged to refer to [
30,
31,
32], for instance. The concept of FIF has been extended by Secelean (see [
33]) to countable systems of data by using countable iterated function systems, or CIFS, for short. For more detailed information on CIFS, see [
34]. More recently, Pacurar combined the idea of using different types of contractions with countable FIFs (see [
35]) and Miculescu et al. introduced a fractal interpolation scheme for a possible sizable set of data (see [
36]).
The first part of the article is devoted to the study of an iterated function system, or IFS for short, defined on
, where
is compact, which defines a FIF, where the ordinate scaling is replaced by a nonlinear contraction. In this way, we obtain Matkowski-FIFs for finite real data and extend our results to the case where we have an infinite (countable) amount of data. Our scheme can be used for any contraction that allows a fixed point theorem on a metric space, which emphasizes the significance to the field of the generalizations brought by the results in the current paper. The second part of the paper provides an extension of the concept of
-FIF by defining a class of interpolation functions
associated with a continuous function
f, called
R-FIF. We define the
R-FIF for both finite and infinite (countable) collections of data. Moreover, for the infinite case, we provide different conditions than in [
35] for the existence of FIF. In the final part of the paper, we construct
R-smooth fractal interpolation functions and extend the results (see, for instance, [
37]) that prove the existence of differentiable and smooth FIF with any order of regularity.
3. Fractal Interpolation Associated with Matkowski Contractions
We consider a general IFS, defined on the set , where I is a compact real interval, related to a partition of it. This system will define a FIF of a set of real data. Firstly, we study the case where the partition has a finite number of points.
3.1. Finite Number of Data
Let
be a partition of
I,
, where
, and a finite set of data
. We define an IFS through a collection of contractive homeomorphisms
, where
, satisfying the conditions
for
and the family of continuous functions
satisfying the “join-up” conditions:
for
. Let us consider the space
is a closed set of the complete subspace of continuous functions
and thus, a complete space with respect to the supremum norm. Let
T be the usual operator for fractal interpolation
defined as
if
. Using the conditions (
1) and (
2), it is easy to check that
is well-defined and further,
for all
.
Lemma 1. Let us define , for and . If is non-decreasing for any , then φ is also non-decreasing.
Proof. It is based on the fact that for any implies that . □
The next result ensures the existence of a fractal interpolant of the given data under some conditions on the maps . From here on, we consider functions non-decreasing, such that for every , where denotes the composition of with itself m times.
Theorem 2. Let be a Matkowski contraction in the second variable, i.e., there exist functions satisfying the conditions of item (iii) of Definition 1 such thatfor all and . We assume further that the map defined as is such that . Then the operator T defined in (3) is a Matkowski contraction, and consequently, it has a fixed point . The map is an interpolant of the data , . Proof. The operator
T satisfies the following equality, for
,
and by hypothesis,
where
. Consequently
and
T is a Matkowski contraction. According to Theorem 1, it has a unique fixed point
. As said previously, all the images of
T are interpolant of the data and, in particular,
. □
Definition 4. The map defined in Theorem 2 is a Matkowski fractal interpolation function of the considered data.
The usual approach to construct a FIF is to obtain a curve that is the attractor of the IFS with , where is lower than 1 in modulus. However, in this paper, we consider nonlinear contractions instead of the scaling term in the y-coordinate.
Corollary 1. If the maps are defined as , where is continuous on , is a Matkowski contraction whose comparison function satisfies the conditions described in Theorem 2 and the maps , satisfy the join-up conditions prescribed in (2), then the IFS defines a Matkowski FIF. Proof. It is a straightforward consequence of Theorem 2. □
Remark 4. The maps can be made more general taking such that is a Matkowski contraction in the second variable. In this case, we also obtain a Matkowski FIF. For instance, satisfies the condition, for , if .
Example 1. Let us consider the set of data in the interval and the maps:for the first coordinate, andIt is an easy exercise to prove that , satisfy the prescribed join-up conditions (1) and (2). Sincefor , are Matkowski contractions in the second variable, with comparison functions . Moreoverand is a Matkowski contraction with comparison function . Thus, the operator T defined by the expression (3) satisfies the inequalitywhere . Consequently, T owns a fixed point defining a fractal function that interpolates the set of data . 3.2. Infinite Number of Data
Consider the countable system of data
where
is a strictly increasing and bounded sequence with
,
and
is a convergent sequence with
, and
. Let us denote
.
We define a family of contractive homeomorphisms
,
, for every
, such that
We consider a countable family of continuous functions
,
, such that
Let us define the subspace of continuous functions
and the operator
defined as
if
, and
. Using the “join-up” conditions on
and
, it is easy to prove that
for any
. The only different issue with respect to the finite case is that one has to prove that
is (left) continuous at
. This is proved in the reference [
35] assuming the hypothesis that
tends to zero when
n goes to infinity (
means the diameter of the image of
). Thus, we propose the next theorem as a generalization of Theorem 3 of the same reference.
Theorem 3. Let be Matkowski contractions in the second variable, that is to say, there exist functions satisfying the conditions of item (iii) of Definition 1 such thatfor all and . We assume further that the map defined as is such that for any and , for any . Then if tends to zero when n goes to infinity, the operator T defined in (5) is a Matkowski contraction and, consequently, has a fixed point . The map is an interpolant of the data , for any . Proof. Take in the proof of the quoted theorem. □
Definition 5. The map defined in Theorem 3 is a Matkowski FIF of the countable collection of data .
Corollary 2. If the maps are defined as , where is continuous on I and is a Matkowski contraction whose function satisfies the conditions described in Theorem 3, the IFS defines a Matkowski FIF for a countable collection of data.
Proof. It is a straightforward consequence of Theorem 3. □
Remark 5. (respectively ) can be Banach and Rakotch contractions, as particular cases of Matkowski contractions.
Remark 6. can be defined as where is Matkowski in the second variable, and it also defines a FIF of a countable set of data. For instance, satisfies the condition, for , if .
Remark 7. The arguments in this section may serve for any contraction admitting a fixed point theorem on a complete metric space.
4. R-Fractal Interpolation Functions
Let us consider again the finite case associated with the set
. Let for
,
be defined as in
Section 3.1, and define
as
for
, where
is a continuous function such that
for
,
is also continuous,
is a Matkowski contraction and
With these conditions we have
and the IFS
satisfies the conditions of Theorem 2. Consequently, there is a fractal interpolant to the data.
Definition 6. We call the fractal interpolant defined by the IFS described above the R-fractal interpolation function associated with f.
Remark 8. This definition generalizes the concept of α-fractal function ([21]), taking and , where and . Remark 9. One can consider different types of contractions to define the R-fractal function, so the results are more general than they appear.
Remark 10. We can generalize the model to , where is a Matkowski contraction in the second variable. This is the case for α-fractal functions with α depending on . The function would be , and , which satisfies the condition required in Theorem 2.
Let us consider now an infinite collection of data
where
is a strictly increasing and bounded sequence with
,
,
is a convergent sequence with
and
. Let us denote
.
Let
,
, be contractive homeomorphisms for every
, such that
Let
such that
for all
. For continuity
. We also define in this case for every
:
satisfying, for any natural
, the matching conditions
The operator
T is defined as the infinite case of the previous section on the space
(
4). In the next theorem, we prove that
T is well-defined. Now we consider different hypotheses to provide a fractal interpolant of the sequence since the (sufficient) condition
as
n tends to infinity is sometimes difficult to check. Therefore, we propose the following result.
Theorem 4. For the IFS whose map is defined by (6), let be a Matkowski contraction, that is to say, there exists a function satisfying the conditions of item (iii) of Definition 1 such thatfor all and . We assume further that the map defined as is such that for any and . Let us choose , such that uniformly. Then the operator T is a Matkowski contraction and, consequently, has a fixed point . The map is an interpolant of the data , for any . Proof. Let us prove that
is continuous at
b. For
,
Given
, the left continuity of
f at
b implies that there exists
such that
implies
Now, the convergence to zero of
,
implies that there are
such that
where
,
. Taking
x close enough to
b, we obtain
The rest is similar to the finite case. □
Remark 11. For the case of α-fractal functions, the conditions on the function imply when n tends to infinity. In the case of variable scaling, the condition is .
4.1. Properties of R-Fractal Interpolation Functions
The operator
T in the
n-th interval is defined as,
and consequently
assuming that the suprema are finite.
In particular, for
, we have
Moreover, defining
, for
,
since
is non-decreasing.
If
is a Rakotch contraction:
if
. If
then
and consequently
In general:
The fixed point equation for
in the interval
is:
An emerging question is if
may agree with
f. The answer is given in the next result.
Proposition 1. if and only if there exist n and such that .
Proof. It is a consequence of the Equation (
8), taking
. □
4.2. Case
Let us consider the particular case where
, and
,
. Then for
Thus, if
is a Rakotch contraction, we have
In this case, we can define a binary internal operation in the space
as:
that generalizes the fractal convolution defined in ([
42]). If we take
in the operator
T, for
, then
Thus, we obtain that
. Consequently,
f is the fixed point of
T and
. The conclusion is that
and the operation is idempotent.
If
and
are Banach contractions with contractivity ratio
, the inequality (
7) becomes:
where
, assuming that
. Inserting in the last norm the map
f, we obtain:
For
-fractal functions ([
21])
and
. The last inequality provides the classical bounding error formula for
-fractal functions (
assuming that
), and the inequality holds for an infinite set of data as well.
4.3. Linear Case
Let us consider a different case, where
and
are linearly dependent of
f, that is to say: there exist two sequences of linear operators such that
and
. Then arguing as in ([
21]) the operator
defined as
is linear. Moreover, if
are bounded,
assuming that
and
are finite. The operator
is also bounded and
Figure 1 represents an
R-fractal function corresponding to a uniform partition of the interval
with five data, function
and maps
for
with comparison functions
,
, and
for all
n.
5. Smooth R-Fractal Interpolation Functions
Let
, and a partition of it
, (
). Let
and
. We consider the finite system of data
Let a finite family of contractive homeomorphisms
be such that
for every
and
.
Let us consider the maps
, where
Y is a compact subset of
, defined as
where
, and
for all
in their ranges. Let us assume that
and
.
Let us define
and the norm
. Then
is a complete metric space.
Let the operator
be defined as usual
for every
.
Theorem 5. For the data , the functions and defined as above let us assume that for every and the following join-up conditions are satisfied:and , . Let us define the operator for as and assume that is a Matkowski contraction for any with comparison function such that satisfies the condition and tends to zero as m tends to infinity. Then there exists a smooth R-FIF satisfying the following functional equations, for every :for , andfor . The function interpolates the data up to the order p: for any in their ranges. Proof. Let
defined for
as
The Faà di Bruno formula for the derivative of a composition of functions provides
and since
satisfy
, we have
Using the fact that
and from (
9) and (
10), we obtain
Moreover,
which proves that
T is well defined. Further, for any
On the other hand, for
,
and
, we have
This proves that
T is a Rakotch contraction on
. Thus, by Theorem 1, we obtain that
T has a unique fixed point
and
, which proves the functional Equations (
11) and (
12). The function
interpolates
f at the nodes up to the order
k. □
Remark 12. In the case of α-fractal functions, and . ConsequentlyThe comparison function of the operator defined as , is . The function defined in the Theorem is . The hypothesis required on φ holds if for any . Let us consider now the smooth case with an infinite number of data
such that
,
is strictly increasing and
. Let
. We consider the system of data, for
such that
for every
p.
Let an infinite family of contractive homeomorphisms
be such that
for every
and
,
.
Let us consider the maps
, where
Y is a compact subset of
, be defined as
where
, and
for all
. The
k-continuity of
f implies that
for
. Let us assume that
,
.
Let
and the norm
, then
is a complete metric space.
Let the operator
be defined as usual
for every
.
Theorem 6. For the data , let the functions and be defined as above for every . Let us assume that the following join-up conditions are satisfied:for , and , . Let us define the operator , for defined as , and assume that is a Matkowski contraction for any with comparison function such that satisfies the conditions for all t and tends to zero as i tends to infinity. Additionally, let us assume that and when . Then there exists a smooth R-FIF such that for every , it satisfies the following functional equations:for andfor . The function interpolates the data up to the order p: for any . Proof. The arguments are analogous to those of Theorems 4 and 5. □
Remark 13. For α-fractal functions, the operators are defined as in the finite case (Remark 12). However, the conditions to be held here are: If then and as i tends to infinity.
6. Conclusions
The main result of this paper concerns IFSs that define FIFs associated with a set of interpolation data, typically defined as
where the maps
are homeomorphisms,
are continuous and both satisfy the join-up conditions (
1), (
2). We have proved that for maps
of type
, or
, where
is continuous and
is a Matkowski contraction, or a Matkowski contraction in the second variable, respectively, the IFS defines a continuous FIF interpolating the data. More precisely, we have proved that the classical vertical scaling term
(or
) may be substituted by a general Matkowski contraction in the
y-variable. This result is true for a finite set and for a countable family of nodal data.
In particular, we have generalized the concept of -fractal function to R-fractal function when the described change in the y-coordinate of is performed. Thus, we have defined more general fractal perturbations of continuous functions. In the last part of the paper, we construct smooth R-fractal functions in the framework of the IFS described above.