Next Article in Journal
Model-Free Fractional-Order Sliding Mode Control of Electric Drive System Based on Nonlinear Disturbance Observer
Next Article in Special Issue
Fractal Perturbation of the Nadaraya–Watson Estimator
Previous Article in Journal
Fractional-Order PD Attitude Control for a Type of Spacecraft with Flexible Appendages
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Scale-Free Fractal Interpolation

by
María A. Navascués
1,*,
Cristina Pacurar
2 and
Vasileios Drakopoulos
3
1
Departamento de Matemática Aplicada, Escuela de Ingeniería y Arquitectura, Universidad de Zaragoza, 50018 Zaragoza, Spain
2
Department of Mathematics and Computer Science, Faculty of Mathematics and Computer Science, Transilvania University of Brasov, 500036 Brasov, Romania
3
Department of Computer Science and Biomedical Informatics, School of Science, University of Thessaly, 35131 Lamia, Greece
*
Author to whom correspondence should be addressed.
Fractal Fract. 2022, 6(10), 602; https://doi.org/10.3390/fractalfract6100602
Submission received: 19 September 2022 / Revised: 4 October 2022 / Accepted: 10 October 2022 / Published: 16 October 2022

Abstract

:
An iterated function system that defines a fractal interpolation function, where ordinate scaling is replaced by a nonlinear contraction, is investigated here. In such a manner, fractal interpolation functions associated with Matkowski contractions for finite as well as infinite (countable) sets of data are obtained. Furthermore, we construct an extension of the concept of α -fractal interpolation functions, herein called R-fractal interpolation functions, related to a finite as well as to a countable iterated function system and provide approximation properties of the R-fractal functions. Moreover, we obtain smooth R-fractal interpolation functions and provide results that ensure the existence of differentiable R-fractal interpolation functions both for the finite and the infinite (countable) cases.

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 f α 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 I × R , where I R 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 f R 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.

2. Preliminaries

Let ( X , d ) be a metric space.
Definition 1.
For the function φ : [ 0 , ) [ 0 , ) (called comparison function), a map f : X X is:
(i) 
φ-contraction if
d ( f ( x ) , f ( y ) ) φ ( d ( x , y ) )
for every x , y X .
(ii) 
Rakotch contraction if it is a φ-contraction where the function φ satisfies: t φ ( t ) t is non-increasing and φ ( t ) t < 1 , for every t > 0 .
(iii) 
Matkowski contraction if it is a φ-contraction where the function φ is non-decreasing and the following limit holds lim n φ n ( t ) = 0 , for every t > 0 .
Remark 1.
Each Banach contraction is a Rakotch contraction with the function φ ( t ) = C t , for every t > 0 , where C [ 0 , 1 ) .
Remark 2.
Each Rakotch contraction is a Matkowski contraction.
Theorem 1.
(see [38]) For the complete metric space ( X , d ) , if the function F : X X is a Matkowski contraction, then F has a unique fixed point x 0 X and lim n F n ( x ) = x 0 for every x X .
Definition 2.
(see [39]) The system of functions { f n } n J is called an iterated function system, or IFS, for short, if:
(i) 
J is finite;
(ii) 
f n : X X are continuous functions;
(iii) 
( X , d ) is a complete metric space.
Remark 3.
(see [40]) If the set J in Definition 2 is countable, then the IFS is called a countable iterated function system, or CIFS, for short.
Definition 3.
For x 1 , x 2 , , x n k + 1 R , we consider the partial or incomplete Bell polynomial ([41]) given by
B n , k ( x 1 ; ; x n k + 1 ) = j 1 + j 2 + + j n k + 1 = k j 1 + 2 j 2 + + ( n k + 1 ) j n k + 1 = n n ! j 1 ! j n k + 1 ! x 1 1 ! j 1 x n k + 1 ( n k + 1 ) ! j n k + 1 .

3. Fractal Interpolation Associated with Matkowski Contractions

We consider a general IFS, defined on the set I × R , 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, Δ : x 0 < x 1 < < x N , where N > 1 , and a finite set of data { ( x i , y i ) } i = 0 N . We define an IFS through a collection of contractive homeomorphisms l n : I I n , where I n = [ x n 1 , x n ] , satisfying the conditions
l n ( x 0 ) = x n 1 ; l n ( x N ) = x n ,
for n = 1 , 2 , , N and the family of continuous functions W n : I × R R satisfying the “join-up” conditions:
W n ( x 0 , y 0 ) = y n 1 ; W n ( x N , y N ) = y n ,
for n = 1 , 2 , , N . Let us consider the space
C 0 ( I ) = { g C ( I ) : g ( x 0 ) = y 0 , g ( x N ) = y N } .
C 0 ( I ) is a closed set of the complete subspace of continuous functions C ( I ) and thus, a complete space with respect to the supremum norm. Let T be the usual operator for fractal interpolation T : C 0 ( I ) C 0 ( I ) defined as
T g ( x ) = W n ( l n 1 ( x ) , ( g l n 1 ) ( x ) ) ,
if x I n . Using the conditions (1) and (2), it is easy to check that T g is well-defined and further,
T g ( x i ) = y i ,
for all i = 0 , 1 , 2 , , N .
Lemma 1.
Let us define φ ( t ) = sup n φ n ( t ) , for t D R and n J . If φ n is non-decreasing for any n J , then φ is also non-decreasing.
Proof. 
It is based on the fact that a n b n for any n J implies that sup n a n sup n b n . □
The next result ensures the existence of a fractal interpolant of the given data under some conditions on the maps W n . From here on, we consider functions φ n : [ 0 , ) [ 0 , ) non-decreasing, such that lim m φ n m ( t ) = 0 for every t > 0 , where φ n m denotes the composition of φ n with itself m times.
Theorem 2.
Let W n be a Matkowski contraction in the second variable, i.e., there exist functions φ n : [ 0 , ) [ 0 , ) satisfying the conditions of item (iii) of Definition 1 such that
| W n ( x , y ) W n ( x , y ) | φ n ( | y y | ) ,
for all n = 1 , 2 , , N and y , y R . We assume further that the map defined as φ ( t ) = sup n φ n ( t ) is such that lim m φ m ( t ) = 0 . Then the operator T defined in (3) is a Matkowski contraction, and consequently, it has a fixed point f * C 0 ( I ) . The map f * is an interpolant of the data ( x i , y i ) , i = 0 , 1 , , N .
Proof. 
The operator T satisfies the following equality, for x I n , g , h C 0 ( I ) :
| T g ( x ) T h ( x ) | = | W n ( l n 1 ( x ) , g l n 1 ( x ) ) W n ( l n 1 ( x ) , h l n 1 ( x ) ) |
and by hypothesis,
| T g ( x ) T h ( x ) | φ n ( | g ( x ˜ ) h ( x ˜ ) | ) φ ( | | g h | | ) ,
where x ˜ = l n 1 ( x ) . Consequently
| | T g T h | | φ ( | | g h | | ) ,
and T is a Matkowski contraction. According to Theorem 1, it has a unique fixed point f * . As said previously, all the images of T are interpolant of the data and, in particular, f * . □
Definition 4.
The map f * = T f * 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 { ( l n , W n ) } n J with W n ( x , y ) = α n y + q n ( x ) , where α n 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 W n : I × R R are defined as W n ( x , y ) = U n ( x ) + R n ( y ) , where U n : I R is continuous on I , R n : R R is a Matkowski contraction whose comparison function φ n satisfies the conditions described in Theorem 2 and the maps U n ( x ) , R n ( y ) satisfy the join-up conditions prescribed in (2), then the IFS { ( l n , W n ) } defines a Matkowski FIF.
Proof. 
It is a straightforward consequence of Theorem 2. □
Remark 4.
The maps W n can be made more general taking W n ( x , y ) = U n ( x ) + R n ( x , y ) such that R n : I × R R is a Matkowski contraction in the second variable. In this case, we also obtain a Matkowski FIF. For instance, R n ( y ) = α n ( x ) y satisfies the condition, for φ n ( t ) = α n t , if α n < 1 .
Example 1.
Let us consider the set of data D = { ( 0 , 0 ) , ( 1 / 3 , 3 ) , ( 2 / 3 , 6 ) , ( 1 , 5 ) } in the interval I = [ 0 , 1 ] and the maps:
l 1 ( x ) = x / 3 ; l 2 ( x ) = ( x + 1 ) / 3 ; l 3 ( x ) = ( x + 2 ) / 3
for the first coordinate, and
W 1 ( x , y ) = 13 x / 6 + x y / ( 1 + y ) ; W 2 ( x ) = 17 / 6 x + 3 + x / ( 1 + y ) ; W 3 ( x ) = x + 6 + x sin ( π y ) 3 π .
It is an easy exercise to prove that l n , W n satisfy the prescribed join-up conditions (1) and (2). Since
| W 1 ( x , y ) W 1 ( x , y ) | | y 1 + y y 1 + y | | y y | 1 + | y y | ,
| W 2 ( x , y ) W 2 ( x , y ) | | 1 1 + y 1 1 + y | | y y | 1 + | y y | ,
for y , y 0 , W 1 , W 2 are Matkowski contractions in the second variable, with comparison functions φ 1 ( t ) = φ 2 ( t ) = t / ( 1 + t ) . Moreover
| W 3 ( x , y ) W 3 ( x , y ) | 1 3 | y y | ,
and W 3 is a Matkowski contraction with comparison function φ 3 ( t ) = t / 3 . Thus, the operator T defined by the expression (3) satisfies the inequality
| | T g T h | | φ ( | | g h | | ) ,
where φ ( t ) = max { φ 1 ( t ) , φ 3 ( t ) } . Consequently, T owns a fixed point defining a fractal function f * that interpolates the set of data D .

3.2. Infinite Number of Data

Consider the countable system of data
Δ = { ( x n , y n ) I × R , n 0 } ,
where ( x n ) n 0 is a strictly increasing and bounded sequence with x 0 = a , lim n x n = b and ( y n ) n 0 is a convergent sequence with lim n y n = M , and I = [ a , b ] . Let us denote m = y 0 .
We define a family of contractive homeomorphisms ( l n ) n 1 , l n : I I n , for every n 1 , such that
l n ( a ) = x n 1 , l n ( b ) = x n .
We consider a countable family of continuous functions ( W n ) n 1 , W n : I × R R , such that
W n ( a , m ) = y n 1 , W n ( b , M ) = y n .
Let us define the subspace of continuous functions
C m , M ( I ) = { g C ( I ) : g ( a ) = m , g ( b ) = M }
and the operator T : C m , M ( I ) C m , M ( I ) defined as
T g ( x ) = W n ( l n 1 ( x ) , g l n 1 ( x ) ) ,
if x I n , and T g ( b ) = M . Using the “join-up” conditions on l n and W n , it is easy to prove that T g ( x n ) = y n for any n 0 . The only different issue with respect to the finite case is that one has to prove that T g is (left) continuous at b . This is proved in the reference [35] assuming the hypothesis that d i a m ( I m ( W n ) ) tends to zero when n goes to infinity ( d i a m ( I m ( W n ) ) means the diameter of the image of W n ). Thus, we propose the next theorem as a generalization of Theorem 3 of the same reference.
Theorem 3.
Let W n be Matkowski contractions in the second variable, that is to say, there exist functions φ n : [ 0 , ) [ 0 , ) satisfying the conditions of item (iii) of Definition 1 such that
| W n ( x , y ) W n ( x , y ) | φ n ( | y y | ) ,
for all n = 1 , , N and y , y R . We assume further that the map defined as φ ( t ) = sup n φ n ( t ) is such that φ ( t ) < for any t > 0 and lim m φ m ( t ) = 0 , for any t > 0 . Then if d i a m ( I m ( W n ) ) tends to zero when n goes to infinity, the operator T defined in (5) is a Matkowski contraction and, consequently, has a fixed point f * C 0 ( I ) . The map f * is an interpolant of the data ( x n , y n ) , for any n 0 .
Proof. 
Take φ ( t ) = sup n φ n ( t ) in the proof of the quoted theorem. □
Definition 5.
The map f * = T f * defined in Theorem 3 is a Matkowski FIF of the countable collection of data { ( x n , y n ) } n 0 .
Corollary 2.
If the maps W n : I × R R are defined as W n ( x , y ) = U n ( x ) + R n ( y ) , where U n : I R is continuous on I and R n : R R is a Matkowski contraction whose function φ n satisfies the conditions described in Theorem 3, the IFS { ( l n , W n ) } n 0 defines a Matkowski FIF for a countable collection of data.
Proof. 
It is a straightforward consequence of Theorem 3. □
Remark 5.
R n (respectively W n ) can be Banach and Rakotch contractions, as particular cases of Matkowski contractions.
Remark 6.
R n can be defined as R n ( x , y ) where R n is Matkowski in the second variable, and it also defines a FIF of a countable set of data. For instance, R n ( y ) = α n ( x ) y satisfies the condition, for φ n ( t ) = α n t , if sup n α n < 1 .
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 { ( x i , y i ) } i = 0 N . Let for n = 1 , 2 , , N , l n be defined as in Section 3.1, and define W n as
W n ( x , y ) = f l n ( x ) S n ( x ) + R n ( y ) ,
for x I n , where f : I R is a continuous function such that
f ( x i ) = y i
for i = 0 , 1 , , N , S n : I R is also continuous, R n is a Matkowski contraction and
S n ( x 0 ) = R n ( y 0 ) , S n ( x N ) = R n ( y N ) .
With these conditions we have
W n ( x 0 , y 0 ) = y n 1 , W n ( x N , y N ) = y n
and the IFS { ( l n , W n ) } satisfies the conditions of Theorem 2. Consequently, there is a fractal interpolant to the data.
Definition 6.
We call the fractal interpolant f R 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 R n ( y ) = α n y and S n ( x ) = α n b ( t ) , where b ( x 0 ) = f ( x 0 ) and b ( x N ) = f ( x N ) .
Remark 9.
One can consider different types of contractions R n to define the R-fractal function, so the results are more general than they appear.
Remark 10.
We can generalize the model to W n ( x , y ) = f l n ( x ) S n ( x ) + R n ( x , y ) , where R n is a Matkowski contraction in the second variable. This is the case for α-fractal functions with α depending on x : R n ( x , y ) = α n ( x ) y . The function would be φ n ( t ) = | | α n | | t , and φ ( t ) = sup n | | α n | | t , which satisfies the condition required in Theorem 2.
Let us consider now an infinite collection of data
Δ = { ( x n , y n ) I × R , n 0 } ,
where ( x n ) n 0 is a strictly increasing and bounded sequence with x 0 = a , lim n x n = b , ( y n ) n 0 is a convergent sequence with lim n y n = M and I = [ a , b ] . Let us denote m = y 0 .
Let ( l n ) n 1 , l n : I I n , be contractive homeomorphisms for every n 1 , such that
l n ( a ) = x n 1 , l n ( b ) = x n .
Let f C ( I ) such that f ( x n ) = y n for all n 0 . For continuity f ( b ) = M . We also define in this case for every n N :
W n ( x , y ) = ( f l n ) ( x ) S n ( x ) + R n ( y ) ,
satisfying, for any natural n , the matching conditions
W n ( x 0 , y 0 ) = y n 1 , W n ( b , M ) = y n .
The operator T is defined as the infinite case of the previous section on the space C m , M ( I ) (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 d i a m ( I m ( W n ) ) 0 as n tends to infinity is sometimes difficult to check. Therefore, we propose the following result.
Theorem 4.
For the IFS whose map W n is defined by (6), let R n be a Matkowski contraction, that is to say, there exists a function φ n : [ 0 , ) [ 0 , ) satisfying the conditions of item (iii) of Definition 1 such that
| R n ( y ) R n ( y ) | φ n ( | y y | ) ,
for all n = 1 , , N and y , y R . We assume further that the map defined as φ ( t ) = sup n φ n ( t ) is such that φ ( t ) < for any t > 0 and lim m φ m ( t ) = 0 . Let us choose R n , S n such that lim n R n ( y ) = lim n S n ( x ) = 0 uniformly. Then the operator T is a Matkowski contraction and, consequently, has a fixed point f * C 0 ( I ) . The map f * is an interpolant of the data ( x n , y n ) , for any n 0 .
Proof. 
Let us prove that T g is continuous at b. For x I n ,
T g ( x ) T g ( b ) = f ( x ) + R n g l n 1 ( x ) S n l n 1 ( x ) f ( b ) .
Given ϵ > 0 , the left continuity of f at b implies that there exists δ > 0 such that b x < δ implies
| f ( x ) f ( b ) | < ϵ 3 .
Now, the convergence to zero of R n , S n implies that there are n 1 , n 2 N such that
| R n g ( x ˜ ) | < ϵ 3 ,
| S n ( x ˜ ) | < ϵ 3 ,
where x ˜ = l n 1 ( x ) , n max { n 1 , n 2 } . Taking x close enough to b, we obtain
| T g ( x ) T g ( b ) | < ϵ .
The rest is similar to the finite case. □
Remark 11.
For the case of α-fractal functions, the conditions on the function imply α n 0 when n tends to infinity. In the case of variable scaling, the condition is | | α n | | 0 .

4.1. Properties of R-Fractal Interpolation Functions

The operator T in the n-th interval is defined as,
T g ( x ) = f ( x ) + R n g ( l n 1 ( x ) ) S n ( l n 1 ( x ) )
and consequently
| | T g f | | sup n | | R n g S n | | sup n ( | | R n | | + | | S n | | ) ,
assuming that the suprema are finite.
In particular, for g = f R , we have
| | f R f | | sup n | | R n f R S n | | .
Moreover, defining x ˜ = l n 1 ( x ) , for x I n ,
| T g ( x ) T h ( x ) | = | R n g ( x ˜ ) R n h ( x ˜ ) | φ n ( | g ( x ˜ ) h ( x ˜ ) | ) φ n ( | | g h | | ) ,
since φ n is non-decreasing.
If R n is a Rakotch contraction:
| T g ( x ) T h ( x ) | < | g ( x ˜ ) h ( x ˜ ) |
if g ( x ˜ ) h ( x ˜ ) . If g ( x ˜ ) = h ( x ˜ ) then T g ( x ) = T h ( x ) and consequently
| | T g T h | | | | g h | | .
In general:
| | T g T h | | sup n φ n ( | | g h | | ) .
The fixed point equation for f R in the interval I n is:
f R ( x ) = f ( x ) + ( R n f R S n ) l n 1 ( x ) .
An emerging question is if f R may agree with f. The answer is given in the next result.
Proposition 1.
f R f if and only if there exist n and x I such that R n f ( x ) S n ( x ) .
Proof. 
It is a consequence of the Equation (8), taking f R = f . □

4.2. Case S n = R n B

Let us consider the particular case where S n = R n B , and B ( a ) = m , B ( b ) = M . Then for x I n
| f R ( x ) f ( x ) | = | R n f R ( x ˜ ) R n B ( x ˜ ) | φ n ( | f R ( x ˜ ) B ( x ˜ ) | ) φ n ( | | f R B | | ) .
Thus, if R n is a Rakotch contraction, we have
| | f R f | | sup n φ n ( | | f R B | | ) | | f R B | | .
In this case, we can define a binary internal operation in the space C m , M ( I ) as:
f B = f R
that generalizes the fractal convolution defined in ([42]). If we take B = f in the operator T, for x I n , then
T f ( x ) = f ( x ) + R n f ( l n 1 ( x ) ) R n f ( l n 1 ( x ) ) .
Thus, we obtain that T f ( x ) = f ( x ) . Consequently, f is the fixed point of T and f R = f . The conclusion is that
f f = f ,
and the operation is idempotent.
If S n = R n B and R n are Banach contractions with contractivity ratio k n , the inequality (7) becomes:
| | f R f | | k | | f R B | | ,
where k = sup n k n , assuming that k < . Inserting in the last norm the map f, we obtain:
| | f R f | | k 1 k | | f B | | .
For α -fractal functions ([21]) R n ( y ) = α n y and S n ( x ) = α n b ( x ) = R n b ( x ) . The last inequality provides the classical bounding error formula for α -fractal functions ( k = | α | assuming that | α | = sup n | α n | < 1 ), and the inequality holds for an infinite set of data as well.

4.3. Linear Case

Let us consider a different case, where R n and S n are linearly dependent of f, that is to say: there exist two sequences of linear operators such that R n = L n f and S n = L n f . Then arguing as in ([21]) the operator L : C ( I ) C ( I ) defined as
L ( f ) = f R
is linear. Moreover, if L n , L n are bounded,
| | L ( f ) f | | sup n | | L n ( f ) f R L n ( f ) | | ( s + s ) | | f | | ,
assuming that s = sup n | | L n | | and s = sup n | | L n | | are finite. The operator L is also bounded and
| | L | | ( 1 + s + s ) .
Figure 1 represents an R-fractal function corresponding to a uniform partition of the interval I = [ 0 , 2 π ] with five data, function f = sin ( x ) and maps R n ( y ) = sin ( n y ) / 6 for n = 1 , , 4 with comparison functions φ n ( t ) = n t / 6 , φ ( t ) = 2 t / 3 , and S n ( x ) = 0 for all n.

5. Smooth R-Fractal Interpolation Functions

Let I = [ a , b ] , and a partition of it Δ : a = x 0 < x 1 < < x N = b , ( N > 1 ). Let I i = [ x i 1 , x i ] and J N = { 0 , 1 , , N } . We consider the finite system of data
Δ = { ( x i , y i , p ) I × R , i J N , 0 p k } .
Let a finite family of contractive homeomorphisms l i : I I i be such that
l i ( a ) = x i 1 and l i ( b ) = x i
for every i J N \ { 0 } and l i ( x ) = a i x + b i .
Let us consider the maps W i : I × Y Y , where Y is a compact subset of R , defined as
W i ( x , y ) = f ( l i ( x ) ) + R i ( y ) S i ( x ) ,
where f C k ( I ) , and f ( p ) ( x i ) = y i , p for all i , p in their ranges. Let us assume that S i C k ( I ) and R i C k ( Y ) .
Let us define
A k ( I ) = { g C k ( I ) : g ( p ) ( a ) = y 0 , p and g ( p ) ( b ) = y N , p , for 0 p k } ,
and the norm g k = max p J k { g ( p ) } . Then ( A k ( I ) , · k ) is a complete metric space.
Let the operator T : A k ( I ) A k ( I ) be defined as usual
T g ( x ) = W i ( l i 1 ( x ) , g ( l i 1 ( x ) ) ) ,
for every x I i .
Theorem 5.
For the data Δ , the functions l i and W i defined as above let us assume that for every i J N and 1 p k the following join-up conditions are satisfied:
S i ( p ) ( a ) = j = 1 p R i ( j ) ( y 0 ) B p , j ( y 0 , 1 ; y 0 , 2 ; y 0 , p j + 1 ) ,
S i ( p ) ( b ) = j = 1 p R i ( j ) ( y N ) B p , j ( y N , 1 ; y N , 2 ; y N , p j + 1 )
and S i ( a ) = R i ( y 0 ) , S i ( b ) = R i ( y N ) . Let us define the operator V i , p : C k ( I ) C ( I ) , for p J k as V i , p ( g ) = ( R i g ) ( p ) , and assume that V i , p is a Matkowski contraction for any i , p with comparison function φ i , p such that φ ( t ) = sup { a i p φ i , p ( t ) : 1 i N , p J k } satisfies the condition φ m ( t ) and tends to zero as m tends to infinity.
Then there exists a smooth R-FIF f R C k ( I ) satisfying the following functional equations, for every p J k :
( f R ) ( p ) ( l i ( x ) ) = f ( p ) ( l i ( x ) ) + + a i p j = 1 p R i ( j ) ( f R ( x ) ) B p , j ( ( f R ) ( x ) ; ( f R ) ( 2 ) ( x ) ; ; ( f R ) ( p j + 1 ) ( x ) ) a i p S i ( p ) ( x ) = f ( p ) ( l i ( x ) ) + a i p ( R i f R ) ( p ) ( x ) a i p S i ( p ) ( x ) ,
for 1 p k , x I , and
f R ( x ) = f ( x ) + ( R i f R S i ) l i 1 ( x ) ,
for x I i . The function f R interpolates the data up to the order p: ( f R ) ( p ) ( x i , p ) = y i , p for any i , p in their ranges.
Proof. 
Let T : A k ( I ) A k ( I ) defined for x I i as
( T g ) ( x ) = f ( x ) + R i ( g ( l i 1 ) ( x ) ) S i ( l i 1 ( x ) )
The Faà di Bruno formula for the derivative of a composition of functions provides
a i p ( T g ) ( p ) ( l i ( x ) ) = a i p f ( p ) ( l i ( x ) ) + j = 1 p R i ( j ) ( g ( x ) ) B p , j ( g ( x ) ; g ( 2 ) ( x ) ; ; g ( p j + 1 ) ( x ) ) S i ( p ) ( x )
and since l i satisfy l i ( a ) = l i 1 ( b ) , we have
a i p ( T g ) ( p ) ( x i + ) = a i p f p ( x i + ) + j = 1 p R i ( j ) ( y 0 ) B p , j ( g ( a ) ; g ( 2 ) ( a ) ; ; g ( p j + 1 ) ( a ) ) S i ( p ) ( a ) ,
a i 1 p ( T g ) ( p ) ( x i ) = a i 1 p f ( p ) ( x i ) + j = 1 p R i 1 ( j ) ( y N ) B p , j ( g ( b ) ; g ( 2 ) ( b ) ; ; g ( p j + 1 ) ( b ) ) S i 1 ( p ) ( b ) .
Using the fact that
f ( p ) ( x i ) = f ( p ) ( x i + ) , for every p J k
and from (9) and (10), we obtain
( T g ) ( p ) ( x i + ) = ( T g ) ( p ) ( x i ) , p J k .
Moreover,
( T g ) ( p ) ( a ) = f ( p ) ( a ) = y 0 , p , p J k ,
( T g ) ( p ) ( b ) = f ( p ) ( b ) = y N , p , p J k ,
which proves that T is well defined. Further, for any g A k ( I )
( T g ) ( p ) ( x i ) = y i , p , p J k .
On the other hand, for g , h A k ( I ) , x I i and p J k , we have
| ( T g ) ( p ) ( x ) ( T h ) ( p ) ( x ) | = a i p | ( R i g ) ( p ) ( x ) ( R i h ) ( p ) ( x ) | a i p | V i , p g ( x ) V i , p h ( x ) | a i p | | V i , p g V i , p h | | a i p φ i , p ( | | g h | | k ) φ ( | | g h | | k )
This proves that T is a Rakotch contraction on A k ( I ) . Thus, by Theorem 1, we obtain that T has a unique fixed point f R A k ( I ) and ( T f R ) ( p ) ( x ) = ( f R ) ( p ) ( x ) , which proves the functional Equations (11) and (12). The function f R interpolates f at the nodes up to the order k. □
Remark 12.
In the case of α-fractal functions, R i ( y ) = α i y and ( R i g ) ( p ) ( x ) = α i g ( p ) ( x ) . Consequently
| | ( R i g ) ( p ) ( R i h ) ( p ) | | | α i | | | g ( p ) h ( p ) | | | α i | | | g h | | k .
The comparison function of the operator V i , p defined as V i , p ( g ) = ( R i g ) ( p ) , is φ i , p ( t ) = | α i | t . The function defined in the Theorem is φ ( t ) = max i , p a i p | α i | t . The hypothesis required on φ holds if a i k | α i | < 1 for any i J N .
Let us consider now the smooth case with an infinite number of data { ( x i , y i ) } i = 0 such that a = x 0 , ( x n ) is strictly increasing and b = lim i x i . Let I i = [ x i 1 , x i ] . We consider the system of data, for p 0 :
Δ = { ( x i , y i , p ) I × R , i 0 , 0 p k } ,
such that lim i y i , p = M p R for every p.
Let an infinite family of contractive homeomorphisms l i : I I i be such that
l i ( a ) = x i 1 and l i ( b ) = x i
for every i 1 and l i ( x ) = a i x + b i , I = [ a , b ] .
Let us consider the maps W i : I × Y Y , where Y is a compact subset of R , be defined as
W i ( x , y ) = f ( l i ( x ) ) + R i ( y ) S i ( x ) ,
where f C k ( I ) , and f ( p ) ( x i ) = y i , p for all i , p . The k-continuity of f implies that f ( p ) ( b ) = M p for 0 p k . Let us assume that S i C k ( I ) , R i C k ( Y ) .
Let
A k ( I ) = { g C k ( I ) : g ( p ) ( a ) = y 0 , p and g ( p ) ( b ) = M p , for 0 p k } ,
and the norm g k = max p J k { g ( p ) } , then ( A k ( I ) , · k ) is a complete metric space.
Let the operator T : A k ( I ) A k ( I ) be defined as usual
T f ( x ) = W i ( l i 1 ( x ) , f ( l i 1 ( x ) ) ) ,
for every x I i .
Theorem 6.
For the data Δ , let the functions l i and W i be defined as above for every i 0 . Let us assume that the following join-up conditions are satisfied:
S i ( p ) ( a ) = j = 1 p R i ( j ) ( y 0 ) B p , j ( y 0 , 1 ; y 0 , 2 ; y 0 , p j + 1 ) ,
S i ( p ) ( b ) = j = 1 p R i ( j ) ( M 0 ) B p , j ( M 1 ; M 2 ; M p j + 1 ) ,
for 1 p k , and S i ( a ) = R i ( y 0 ) , S i ( b ) = R i ( M 0 ) . Let us define the operator V i , p : C k ( I ) C ( I ) , for p J k defined as V i , p ( g ) = ( R i g ) ( p ) , and assume that V i , p is a Matkowski contraction for any i , p with comparison function φ i , p such that φ ( t ) = sup { a i p φ i , p ( t ) : i N , p J k } satisfies the conditions φ ( t ) < for all t and φ i ( t ) tends to zero as i tends to infinity. Additionally, let us assume that | | R i | | k 0 and | | S i | | k 0 when i .
Then there exists a smooth R-FIF f R C k ( I ) , such that for every p 1 , it satisfies the following functional equations:
( f R ) ( p ) ( l i ( x ) ) = f ( p ) ( l i ( x ) ) + + a i p k = 1 p R i ( k ) ( f R ( x ) ) B p , k ( ( f R ) ( x ) ; ( f R ) ( 2 ) ( x ) ; ; ( f R ) ( p k + 1 ) ( x ) ) a i p S i ( p ) ( x ) = f ( p ) ( l i ( x ) ) + a i p ( R i f R ) ( p ) ( x ) a i p S i ( p ) ( x ) ,
for x I and
f R ( x ) = f ( x ) + ( R i f R S i ) l i 1 ( x ) ,
for x I i . The function f R interpolates the data up to the order p: ( f R ) ( p ) ( x i , p ) = y i , p for any i , p .
Proof. 
The arguments are analogous to those of Theorems 4 and 5. □
Remark 13.
For α-fractal functions, the operators V i , p are defined as in the finite case (Remark 12). However, the conditions to be held here are: If c i = a i k | α i | then c = sup i c i < 1 and c i 0 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
F n ( x , y ) = ( l n ( x ) , W n ( x , y ) ) ,
where the maps l n are homeomorphisms, W n are continuous and both satisfy the join-up conditions (1), (2). We have proved that for maps W n of type W n ( x , y ) = U n ( x ) + R n ( y ) , or W n ( x , y ) = U n ( x ) + R n ( x , y ) , where U n is continuous and R n 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 α n y (or α n ( x ) y ) 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 W n 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.

Author Contributions

Conceptualization, M.A.N., C.P. and V.D.; methodology, M.A.N.; supervision, M.A.N. and V.D.; visualization, C.P.; writing—original draft preparation, C.P.; writing—review and editing, C.P. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Barnsley, M.F. Fractal functions and interpolation. Constr. Approx. 1986, 2, 303–329. [Google Scholar] [CrossRef]
  2. Balasubramani, N.; Prasad, M.G.P.; Natesan, S. Fractal quintic spline solutions for fourth-order boundary-value problems. Int. J. Appl. Comp. Math. 2019, 5, 1–21. [Google Scholar] [CrossRef]
  3. Buescu, J.; Serpa, C. Explicitly defined fractal interpolation functions with variable parameters. Chaos Solitons Fractals 2015, 75, 76–83. [Google Scholar]
  4. Dalla, L. Bivariate fractal interpolation on grids. Fractals 2002, 10, 53–58. [Google Scholar] [CrossRef]
  5. Lour, D.-C. Fractal interpolation functions for random data sets. Chaos Solitons Fractals 2018, 114, 256–263. [Google Scholar] [CrossRef]
  6. Massopust, P.R. Fractal interpolation over nonlinear partitions. Chaos Solitons Fractals 2022, 162, 1–8. [Google Scholar] [CrossRef]
  7. Prasad, S.A. Fractional calculus of coalescence hidden-variable fractal interpolation functions. Fractals 2017, 25, 1750019. [Google Scholar] [CrossRef]
  8. Prasad, S.A.; Kapoor, G.P. Superfractal interpolation functions. Int. J. Nonlinear Sci. 2015, 19, 20–29. [Google Scholar]
  9. Wang, H.Y.; Yu, J.S. Fractal interpolation functions with variable parameters and their analytical properties. J. Approx. Theory 2013, 175, 1–18. [Google Scholar] [CrossRef]
  10. Manousopoulos, P.; Drakopoulos, V.; Theoharis, T. Curve fitting by fractal interpolation. In Transactions on Computational Science I. Lecture Notes in Computer Science; Gavrilova, M.L., Tan, C.J.K., Eds.; Springer: Berlin/Heidelberg, Germany, 2008; Volume 4750. [Google Scholar]
  11. Chen, C.; Cheng, S.; Huang, Y. The reconstruction of satellite images based on fractal interpolation. Fractals 2011, 19, 347–354. [Google Scholar] [CrossRef]
  12. Drakopoulos, V.; Bouboulis, P.; Theodoridis, S. Image compression using affine fractal interpolation on rectangular lattices. Fractals 2006, 14, 259–269. [Google Scholar] [CrossRef] [Green Version]
  13. Pacurar, C.M.; Necula, B.R. An analysis of COVID-19 spread based on fractal interpolation and fractal dimension. Chaos Solitons Fractals 2020, 139, 110073. [Google Scholar] [CrossRef]
  14. Bloem, P. Machine Learning and Fractal Geometry. PhD Thesis, University of Amsterdam, Amsterdam, The Netherlands, 2010. [Google Scholar]
  15. Karaca, Y.; Baleanu, D.; Zhang, Y.-D.; Gervasi, O.; Moonis, M. Multi-Chaos, Fractal and Multifractional Artificial Intelligence of Different Complex Systems; Academic Press-Elsevier: Cambridge, MA, USA, 2022. [Google Scholar]
  16. Al-Jawfi, R.A. The effect of learning rate on fractal image coding using artificial neural networks. Fractal Fract. 2022, 6, 280. [Google Scholar] [CrossRef]
  17. Petkovic, D.; Nikolic, V.; Mitic, V.V.; Kocic, L. Estimation of fractal representation of wind speed fluctuation by artificial neural network with different training algorithms. Flow Meas. Instrum. 2017, 54, 172–176. [Google Scholar] [CrossRef] [Green Version]
  18. An, Q.; Chen, X.; Wang, H.; Yang, H.; Huang, W.; Wang, L. Segmentation of concrete cracks by using fractal dimension and UHK-Net. Fractal Fract. 2022, 6, 95. [Google Scholar] [CrossRef]
  19. Sivia, J.S.; Pharwaha, A.P.S.; Kamal, T.S. Analysis and design of circular fractal antenna using artificial neural networks. Prog. Electromagn. Res. B 2013, 56, 251–267. [Google Scholar] [CrossRef] [Green Version]
  20. El-Sonbaty, I.A.; Khashaba, U.A.; Selmy, A.I.; Ali, A.I. Prediction of surface roughness profiles for milled surfaces using an artificial neural network and fractal geometry approach. J. Mater. Process. Technol. 2008, 200, 271–278. [Google Scholar] [CrossRef]
  21. Navascués, M.A. A fractal approximation to periodicity. Fractals 2006, 14, 315–325. [Google Scholar] [CrossRef]
  22. Aridevan, A.; Gowrisankar, A.; Priyanka, T.M.C. Construction of new fractal interpolation functions through integration method. Results Math. 2022, 77, 1–20. [Google Scholar]
  23. Priyanka, T.M.C.; Valarmathi, R.; Bingi, K.; Gowrisankar, A. On approximation properties of fractional integral for α-fractal functions. Math. Probl. Eng. 2022, 4, 1–17. [Google Scholar] [CrossRef]
  24. Viswanathan, P.; Navascués, M.A. A fractal operator on some standard spaces of functions. Proc. Edinburg Math. Soc. 2017, 60, 771–786. [Google Scholar] [CrossRef] [Green Version]
  25. Akhtar, N.; Prasad, G.P.; Navascués, M.A. Box dimension of α-fractal function with variable scaling factors in subintervals. Chaos Solitons Fractals 2017, 103, 440–449. [Google Scholar] [CrossRef]
  26. Jha, S.; Verma, S.; Chand, A.K.B. Non-stationary zipper α-fractal functions and associated operator. Fract. Calc. Appl. Anal. 2022, 25, 1527–1552. [Google Scholar] [CrossRef]
  27. Katiyar, S.K.; Chand, A.K.B. A-fractal rational functions and their positivity aspects. In Proceedings of the Fifth International Conference on Mathematics and Computing; Springer: Singapore, 2020; pp. 205–215. [Google Scholar]
  28. Vijender, N. Approximation by hidden-variable fractal functions: A sequential approach. Results Math. 2019, 74, 1–23. [Google Scholar] [CrossRef]
  29. Navascués, M.A.; Mohapatra, R.N.; Akhtar, M.N. Fractal frames of functions on the rectangle. Fractal Fract. 2021, 5, 42. [Google Scholar] [CrossRef]
  30. Drakopoulos, V.; Ri, S.-I. Generalised fractal interpolation curved lines and surfaces. Nonlinear Stud. 2021, 28, 427–488. [Google Scholar]
  31. Ri, S.-I. A new nonlinear fractal interpolation function. Fractals 2017, 25, 1750063. [Google Scholar] [CrossRef]
  32. Kim, J.; Kim, H.; Mun, H. Nonlinear fractal interpolation curves with function vertical scaling factors. Indian J. Pure Appl. Math. 2020, 51, 483–499. [Google Scholar] [CrossRef]
  33. Secelean, N.A. The fractal interpolation for countable systems of data. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. 2003, 14, 11–19. [Google Scholar] [CrossRef]
  34. Mihail, A.; Miculescu, R. The shift space for an infinite iterated function system. Math. Rep. 2009, 11, 21–32. [Google Scholar]
  35. Pacurar, C.M. A countable fractal interpolation scheme involving Rakotch contractions. Results Math. 2021, 76, 161. [Google Scholar] [CrossRef]
  36. Miculescu, R.; Mihail, A.; Pacurar, C.M. A fractal interpolation scheme for a possible sizeable set of data. J. Fractal Geom. 2022. published online first. [Google Scholar] [CrossRef]
  37. Barnsley, M.F.; Harrington, A.N. The calculus of fractal interpolation functions. J. Approx. Theory 1989, 57, 14–34. [Google Scholar] [CrossRef] [Green Version]
  38. Matkowski, J. Integrable solutions of functional equations. Dissertationes Math. 1975, 127, 68. [Google Scholar]
  39. Hutchinson, J. Fractals and self similarity. Indiana Univ. Math. J. 1981, 30, 713–747. [Google Scholar] [CrossRef]
  40. Secelean, N.A. Countable iterated function systems. Far East J. Dyn. Syst. 2001, 3, 149–167. [Google Scholar]
  41. Bell, E.T. Exponential polynomials. Ann. Math. 1934, 35, 258–277. [Google Scholar] [CrossRef]
  42. Navascués, M.A.; Massopust, P. Fractal convolution: A new operation between functions. Fract. Calc. Appl. Anal. 2009, 22, 619–643. [Google Scholar] [CrossRef]
Figure 1. R-fractal sinus.
Figure 1. R-fractal sinus.
Fractalfract 06 00602 g001
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Navascués, M.A.; Pacurar, C.; Drakopoulos, V. Scale-Free Fractal Interpolation. Fractal Fract. 2022, 6, 602. https://doi.org/10.3390/fractalfract6100602

AMA Style

Navascués MA, Pacurar C, Drakopoulos V. Scale-Free Fractal Interpolation. Fractal and Fractional. 2022; 6(10):602. https://doi.org/10.3390/fractalfract6100602

Chicago/Turabian Style

Navascués, María A., Cristina Pacurar, and Vasileios Drakopoulos. 2022. "Scale-Free Fractal Interpolation" Fractal and Fractional 6, no. 10: 602. https://doi.org/10.3390/fractalfract6100602

Article Metrics

Back to TopTop