Next Article in Journal
Generalized Tikhonov Method and Convergence Estimate for the Cauchy Problem of Modified Helmholtz Equation with Nonhomogeneous Dirichlet and Neumann Datum
Next Article in Special Issue
On Non-Tensor Product Bivariate Fractal Interpolation Surfaces on Rectangular Grids
Previous Article in Journal
The Application of Fractional Calculus in Chinese Economic Growth Models
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Non-Stationary Fractal Interpolation

Center of Mathematics, Technical University of Munich, 85748 Garching, Germany
Mathematics 2019, 7(8), 666; https://doi.org/10.3390/math7080666
Submission received: 1 July 2019 / Revised: 17 July 2019 / Accepted: 24 July 2019 / Published: 25 July 2019
(This article belongs to the Special Issue Fractals: Geometry, Analysis and Mathematical Physics)

Abstract

:
We introduce the novel concept of a non-stationary iterated function system by considering a countable sequence of distinct set-valued maps { F k } k N where each F k maps H ( X ) H ( X ) and arises from an iterated function system. Employing the recently-developed theory of non-stationary versions of fixed points and the concept of forward and backward trajectories, we present new classes of fractal functions exhibiting different local and global behavior and extend fractal interpolation to this new, more flexible setting.

1. Introduction

Contractive operators on complete function spaces play a crucial role in the theory of differential and integral equations and are essential for the development of iterative solvers. One class of such contractive operators is defined on the graphs of functions using a particular type of iterated function system (IFS). The fixed points of such IFSs are graphs of functions that exhibit fractal characteristics. There exists an extensive literature on IFSs and fractal functions including, for instance, [1,2,3].
Up to now, the construction of contractive operators on sets or functions uses primarily sequences of iterates of one operator. Recently, motivated by non-stationary subdivision algorithms, a more general class of sequences consisting of different contractive operators was introduced in [4] and their limit properties studied. These ideas were then extended in [5] to sequences of different contractive operators mapping between different spaces. Using different contractive operators provide one with the ability to construct limit attractors that have different shapes or features at different scales.
This article uses the aforementioned new ideas to introduce the novel concept of non-stationary IFS and non-stationary fractal interpolation. These new ideas widen the applicability of fractal functions and fractal interpolation as they now include scale- and location-dependent features.
The outline of this paper is as follows. After providing some necessary preliminaries in Section 2, some results from [4] are presented in Section 3. In Section 4, (stationary) fractal interpolation and the associated (stationary) IFSs are reviewed. Non-stationary fractal functions are constructed in Section 5, and non-stationary fractal interpolation is introduced in Section 6. The final Section 7 defines non-stationary fractal functions on the Bochner–Lebesgue L p -spaces with 0 < p .

2. Preliminaries

Let ( X , d ) be a complete metric space. Given a map f : X X , the Lipschitz constant associated with f is defined by:
Lip ( f ) = sup x , y X , x y d f ( x ) , f ( y ) d ( x , y ) .
The map f is called Lipschitz if Lip ( f ) < + and a contraction on X if Lip ( f ) < 1 .
Definition 1.
Let ( X , d ) be a complete metric space and F : = { f 1 , , f n } a finite family of contractions on X. Then, the pair ( X , F ) is called a contractive iterated function system (IFS) on X.
Remark 1.
As we deal exclusively with contractive IFSs in this article, we drop the adjective “contractive” in the following.
Remark 2.
In order to avoid trivialities, we henceforth assume that the number of maps in an IFS is an integer greater than one.
With an IFS ( X , F ) and its point maps f F , we can associate a set-valued mapping, also denoted by F , as follows. Let ( H ( X ) , h ) be the hyperspace of all nonempty compact subsets of X endowed with the Hausdorff–Pompeiu metric:
h ( S 1 , S 2 ) : = max { d ( S 1 , S 2 ) , d ( S 2 , S 1 ) } ,
where d ( S 1 , S 2 ) : = sup x S 1 d ( x , S 2 ) : = sup x S 1 inf y S 2 d ( x , y ) .
Define the mapping F : H ( X ) H ( X ) by [1,6]:
F ( S ) : = i = 1 n f i ( S ) .
It is known that for contractive mappings f F , the set-valued map F defined by (1) is a contractive Lipschitz map on H ( X ) with Lipschitz constant Lip ( F ) = max { Lip ( f i ) : i N n } . Here, we set N n : = { 1 , , n } . Moreover, the completeness of ( X , d ) implies the completeness of ( H ( X ) , h ) .
The next definition is motivated by the validity of the Banach fixed point theorem in the above setting.
Definition 2.
The unique fixed point A H ( X ) of the contractive set-valued map F is called the attractor of the IFS ( X , F ) .
Note that since A satisfies the self-referential equation:
A = F ( A ) = i = 1 n f i ( A ) ,
the attractor is in general a fractal set.
It follows directly from the proof of the Banach fixed point theorem that the attractor A is obtained as the limit (in the Hausdorff–Pompeiu metric) of the iterative process A k : = F ( A k 1 ) , k N :
A = lim k A k = lim k F k ( A 0 ) ,
for an arbitrary A 0 H ( X ) . Here, F k denotes the k-fold composition of F with itself.
We refer to the element A k H ( X ) as the k th level approximant of A or as a pre-fractal of rank k [2].

3. Systems of Function Systems

In [4], a generalization of IFSs was presented. The idea for this generalization comes from the theory of subdivision schemes. Instead of using only one set-valued map F to obtain an iterative process { A n } n N with initial A 0 H ( X ) , a sequence of function systems consisting of different families F is considered.
To this end, let ( X , d ) be a complete metric space and { T k } k N a sequence of transformations T k : X X .
Definition 3.
([4], Definition 3.6) Let { T k } k N be a sequence of transformations T k : X X . A subset I of X is called an invariant set of the sequence { T k } k N if:
k N x I : T k ( x ) I .
A criterion for obtaining an invariant domain for a sequence { T k } k N of transformations on X is given below.
Proposition 1.
([4], Lemma 3.7) Let { T k } k N be a sequence of transformations on ( X , d ) . Suppose there exists a q X such that for all x X :
d ( T k ( x ) , q ) μ d ( x , q ) + M ,
for some μ [ 0 , 1 ) and M > 0 . Then, the ball B r ( q ) of radius r = M / ( 1 μ ) centered at q is an invariant set for { T k } k N .
Proof. 
For the proof, we refer the interested reader to [4]. □
Now, suppose that { F k } k N is a sequence of set-valued maps F k : H ( X ) H ( X ) defined by:
F k ( A 0 ) : = i = 1 n k f i , k ( A 0 ) , A 0 H ( X ) ,
where F k = { f i , k : i N n k } is a family of contractions constituting an IFS on a complete metric space ( X , d ) . Setting s i , k : = Lip ( f i , k ) , we obtain that Lip ( F k ) = max { s i , k : i N n k } < 1 .
The following definitions are taken from [4] (Section 4).
Definition 4.
Let A 0 H ( X ) . The sequences:
Φ k ( A 0 ) : = F k F k 1 F 1 ( A 0 )
and:
Ψ k ( A 0 ) : = F 1 F 2 F k ( A 0 )
are called the forward and backward trajectories of A 0 , respectively.
For our current setting, it was shown in ([4], Corollary 4.2) that if:
(i)
n : = n k , for all k N ;
(ii)
there exists a common nonempty compact invariant set I X for the maps { f i , k } , i N n , k N , such that { f i , k } k N converges uniformly on I to f i as k ;
(iii)
the IFS ( X , F ) with F = { f i : i N n } is contractive on ( X , d ) ;
then the forward trajectory { Φ k ( A 0 ) } converges for an arbitrary A 0 I to the unique attractor of ( X , F ) .
It was observed in [4] that the limits of forward trajectories do not lead to new classes of fractals. On the other hand, backward trajectories converge under rather mild conditions, even when forward trajectories do not converge to a (contractive) IFS, and generate new types of fractal sets.
As the convergence of backward trajectories is important for this article, we summarize the result in the next theorem, whose proof the reader can find in [4].
Theorem 1.
([4], Corollary 4.4) Let { F k } k N be a family of set-valued maps of the form (4) whose elements are collections F k = { f i , k : i N n k } of contractions constituting IFSs on a complete metric space ( X , d ) . Suppose that:
(i)
there exists a nonempty closed invariant set I X for { f i , k } , i N n k , k N ;
(ii)
and:
k = 1 j = 1 k Lip ( F j ) < .
Then, the backward trajectories { Ψ k ( A 0 ) } converge for any initial A 0 I to a unique attractor A I .
Remark 3.
In [4] (Proposition 3.11), it was required that the invariant set I be compact. However, it suffices to only require that I be closed as ( X , d ) is complete (see the proof of Proposition 3.11 in [4]).
Remark 4.
The conditions for convergence of the forward and backward trajectories are more general in [4]. For our purposes and setting, the above criteria are however sufficient.
Remark 5.
Fractals generated by backwards trajectories allow for more flexibility in their shapes. By a proper choice of IFSs, one can construct fractals exhibiting different local behavior (cf. [4]). This is due to the fact that in the sequence:
F 1 F 2 F k 1 F k ( A 0 ) , A 0 H ( X ) ,
the global shape of the attractor is determined by the initial maps F 1 F 2 , whereas the local shape is given by the final maps F k 1 F k . Thus, scaling the attractor by Lip ( Ψ k ) , Ψ k = F 1 F 2 F k 1 F k , reveals the behavior of the attractor of { F m } m > k . See also [4] (Example 5.1).
Remark 6.
A comparison to V-variable fractals [7] was also undertaken in [4] (Section 4.1), showing that systems of function systems (SFSs) have weaker prerequisites than V-variable fractals.

4. Fractal Interpolation

Before introducing the new concept of non-stationary fractal interpolation, we need to briefly recall the rudimentaries of (stationary) fractal interpolation and (stationary) fractal functions. This is the purpose of the current section.

4.1. Stationary Fractal Interpolation

Suppose we are given a finite family { l i } i = 1 n of injective contractions X X generating a partition of X in the sense that:
X = i = 1 n l i ( X ) ;
l i ( X ) l j ( X ) = , i , j N n , i j .
Let ( Y , d Y ) be a complete metric space with metric d Y . A map g : X Y is called bounded (with respect to the metric d Y ) if there exists a constant M > 0 such that for all x 1 , x 2 X , d Y ( g ( x 1 ) , g ( x 2 ) ) < M .
Recall that the set B ( X , Y ) : = { g : X Y : g is bounded } becomes a complete metric space when endowed with the metric:
d ( g , h ) : = sup x X d Y ( g ( x ) , h ( x ) ) .
Remark 7.
Under the usual addition and scalar multiplication of functions, the space B ( X , Y ) is actually a metric linear space, i.e., a vector space for which the operations of vector addition and scalar multiplication are continuous (see, for instance, [8]).
For i N n , let F i : X × Y Y be a mapping that is uniformly contractive in the second variable, i.e., there exists a c [ 0 , 1 ) so that for all y 1 , y 2 Y :
d Y ( F i ( x , y 1 ) , F i ( x , y 2 ) ) c d Y ( y 1 , y 2 ) , x X , i N n .
Define an operator T : B ( X , Y ) B ( X , Y ) by:
T g ( x ) : = i = 1 n F i ( l i 1 ( x ) , g l i 1 ( x ) ) χ l i ( X ) ( x ) ,
where χ M denotes the characteristic function of a set M. Such operators are referred to as Read–Bajractarević (RB) operators. The operator T is well defined, and since g is bounded and each F i contractive in the second variable, T g B ( X , Y ) .
Equivalently, (12) can also be expressed in the form:
( T g l i ) ( x ) : = F i ( x , g ( x ) ) , x X , i N n .
Moreover, (11) implies that T is contractive on B ( X , Y ) :
d ( T g , T h ) = sup x X d Y ( T g ( x ) , T h ( x ) ) = sup x X d Y ( F ( l i 1 ( x ) , g ( l i 1 ( x ) ) ) , F ( l i 1 ( x ) , h ( l i 1 ( x ) ) ) ) c sup x X d Y ( g l i 1 ( x ) , h l i 1 ( x ) ) c d Y ( g , h ) .
To achieve notational simplicity, we set F ( x , y ) : = i = 1 n F i ( x , y ) χ X ( x ) in the above equation.
Therefore, by the Banach fixed point theorem, T has a unique fixed point f * in B ( X , Y ) . This unique fixed point is called the bounded fractal function (generated by T), and it satisfies the self-referential equation:
f * ( x ) = i = 1 n F i ( l i 1 ( x ) , f * l i 1 ( x ) ) χ l i ( X ) ( x ) ,
or, equivalently,
f * l i ( x ) = F i ( x , f * ( x ) ) , x X , i N n .
The fixed point f * B ( X , Y ) is obtained as the limit of the sequence of mappings:
T k ( f 0 ) f * , as k ,
where f 0 B ( X , Y ) is arbitrary.
Next, we would like to consider a special choice for the mappings F i . To this end, we require the concept of an F-space. We recall that a metric d : Y × Y R is called complete if every Cauchy sequence in Y converges (with respect to d) to a point of Y, and translation-invariant if:
d ( x + a , y + a ) = d ( x , y ) , for all x , y , a Y .
Now, assume that Y is an F-space, i.e., a topological vector space whose topology is induced by a complete translation-invariant metric d and, in addition, that this metric is homogeneous. This setting allows us to consider mappings F i of the form:
F i ( x , y ) : = q i ( x ) + S i ( x ) y , i N n ,
where q i B ( X , Y ) and S i : X R is a function.
The metric d Y is homogeneous, and therefore, the mappings (18) satisfy condition (11) if the functions S i are assumed to be bounded on X with bounds in [ 0 , 1 ) . For then:
d Y ( q i ( x ) + S i ( x ) y 1 , q i ( x ) + S i ( x ) y 2 ) = d Y ( S i ( x ) y 1 , S i ( x ) y 2 ) = | S i ( x ) | d Y ( y 1 , y 2 ) S i d Y ( y 1 , y 2 ) s d Y ( y 1 , y 2 ) .
Here, · denotes the supremum norm and s : = max { S i : i N n } . Henceforth, we will assume that all functions S i are bounded above by s [ 0 , 1 ) .
With the choice (18), the RB operator T becomes an affine operator on B ( X , Y ) of the form:
T g = i = 1 n q i l i 1 χ l i ( X ) + i = 1 n S i l i 1 · g l i 1 χ l i ( X )
= T ( 0 ) + i = 1 n S i l i 1 · g l i 1 χ l i ( X ) .
Next, we exhibit the relationship between the graph G ( f * ) of the fixed point f * of the operator T given by (12) and the attractor of an associated contractive IFS.
To this end, consider the complete metric space X × Y , and define mappings w i : X × Y X × Y by:
w i ( x , y ) : = ( l i ( x ) , F i ( x , y ) ) , i N n .
Assume that the mappings F i in addition to being uniformly contractive in the second variable are also uniformly Lipschitz continuous in the first variable, i.e., there exists a constant L > 0 such that for all y Y ,
d Y ( F i ( x 1 , y ) , F i ( x 2 , y ) ) L d X ( x 1 , x 2 ) , x 1 , x 2 X , i = 1 , , n .
Denote by a : = max { a i : i N n } the largest of the contractivity constants of the l i , and let θ : = 1 a 2 L . Then, the mapping d θ : ( X × Y ) × ( X × Y ) R given by:
d θ : = d X + θ d Y
is a metric on X × Y compatible with the product topology on X × Y .
The next theorem is a special case of a result presented in [9].
Theorem 2.
The family F T : = ( X × Y , w 1 , w 2 , , w n ) is a contractive IFS in the metric d θ , and the graph G ( f * ) of the fractal function f * generated by the RB operator T given by (12) is the unique attractor of F T . Moreover,
G ( T g ) = F T ( G ( g ) ) , g B ( X , Y ) ,
where F T denotes the set-valued operator (1).
Equation (22) can be represented by the following commutative diagram:
X × Y F T X × X G G G G B ( X , Y ) T B ( X , Y )
where G is the mapping B ( X , Y ) g G ( g ) = { ( x , g ( x ) ) : x X } X × Y .
Conversely, assume that F = ( X × Y , w 1 , w 2 , , w n ) is an IFS whose maps w i are of the form (21) where the functions l i are contractive injections satisfying (8) and (9), and the mappings F i are uniformly Lipschitz continuous in the first variable and uniformly contractive in the second variable. Thus, an RB operator T F of the form (12) can be associated with the IFS F . The attractor A F of F is then the graph G ( f ) of the fixed point f of T F (this was the original approach in [10] to define a fractal interpolation function on a compact interval in R ). The diagram (23) is then commutative with F T replaced by F and T replaced by T F .
We now specialize even further and choose arbitrary f , b B ( X , Y ) and set:
q i : = f l i S i · b .
Then, the RB operator T becomes:
T g = f + ( S i l i 1 ) · ( g b ) l i 1 , on l i ( X ) , i N n ,
and under the assumption that s < 1 , its unique fixed point f * B ( X , Y ) satisfies the self-referential equation:
f * = f + ( S i l i 1 ) · ( f * b ) l i 1 , on l i ( X ) , i N n .
Remark 8.
The functions f and b are referred to as the seed and base function, respectively.
Remark 9.
The fixed point f * in (26) clearly depends on the seed function f, the base function b, and the scaling functions S i . Fixing f and b, but varying S i generate an uncountable family of fractal functions f * = f * ( S 1 , , S n ) originating from f = f * ( 0 , , 0 ) .
In the case of univariate fractal interpolation on the real line with X : = [ a , b ] , < a < b < + , the base function b can be chosen to be the affine function whose graph connects the points ( a , f ( a ) ) and ( b , f ( b ) ) .
If we consider the complete metric space of continuous functions ( C ( X , R ) , d ) instead of ( B ( X , R ) , d ) , define:
x 0 : = a , x n : = b , and x i : = l i ( b ) , i N n ,
and impose the join-up conditions:
T f ( x j ) = T f ( x j + ) , j N n 1 ,
the fixed point f * will be a continuous function whose graph interpolates the set { ( x j , f ( x j ) ) : j = 0 , 1 , , n } . Such functions are usually referred to as fractal interpolation functions [6,10]. As the RB operator is the same at each level of recursion (17), we refer to this as stationary fractal interpolation.

5. Non-Stationary Fractal Functions

Here, we introduce non-stationary versions of the concepts of fractal functions as presented in the previous section.
To this end, consider a doubly-indexed family of injective contractions { l i k , k : i k N n k , k N } from X X generating a partition of X for each k N in the sense of (8) and (9).
Suppose that Y is an F-space, { q i k , k : i k N n k , k N } B ( X , Y ) and { S i k , k : i k N n k , k N } B ( X , R ) is such that:
s : = sup k N max i k N k S i k , k < 1 .
For each k N , define an RB operator T k : B ( X , Y ) B ( X , Y ) by:
T k f : = i k = 1 n k q i k , k l i k , k 1 χ l i k , k ( X ) + i k = 1 n k S i k , k l i k , k 1 · f l i k , k 1 χ l i k , k ( X )
= T k ( 0 ) + i k = 1 n k S i k , k l i k , k 1 · f l i k , k 1 χ l i k , k ( X ) .
It is straightforward to verify that each RB operator T k is a contraction on B ( X , Y ) with Lipschitz constant:
Lip ( T k ) = max i k N k S i k , k s < 1 .
Proposition 2.
Let { T k } k N be a sequence of RB operators of the form (28) on ( B ( X , Y ) , d ) . Suppose that the elements of { q i k , k : i k N n k , k N } satisfy:
sup k N max i k N k d ( q i k , k , 0 ) M ,
for some M > 0 . Then, the ball B r ( 0 ) of radius r = M / ( 1 s ) centered at 0 B ( X , Y ) is an invariant set for { T k } k N .
Proof. 
Note that since Y is an F-space, we have for all a , b Y ,
d Y ( a + b , 0 ) d Y ( a + b , b ) + d Y ( b , 0 ) = d Y ( a , 0 ) + d Y ( b , 0 ) .
Now, let x X . Then, there exists an i k N n k with x l i k , k ( X ) . Thus, for any f B ( X , Y ) ,
d Y ( T k f ( x ) , 0 ) d Y ( S i k , k l i k , k 1 ( x ) · f l i k , k 1 ( x ) , 0 ) + d Y ( T k ( 0 ) , 0 ) .
By (31), T k ( 0 ) is uniformly bounded in B ( X , Y ) by M > 0 . As the metric d Y is homogeneous,
d Y ( S i k , k l i k , k 1 ( x ) · f l i k , k 1 ( x ) , 0 ) s d Y ( f l i k , k 1 ( x ) , 0 ) ,
which shows, after taking the sup over x X , that d ( T k f , 0 ) s d ( f , 0 ) + M . Proposition 1 now yields the statement. □
Considering the backward trajectories { Ψ k } k N of the sequence { T k } k N of RB operators defined above and using Theorem 1, we obtain the next result.
Theorem 3.
The backwards trajectories { Ψ k } k N converge for any initial f 0 I to a unique attractor f * I , where I is the closed ball in B ( X , Y ) of radius M / ( 1 s ) centered at zero.
Proof. 
By Theorem 1, it remains to show that k = 1 j = 1 k Lip ( T j ) converges. This, however, follows directly from (30):
j = 1 k Lip ( T j ) s k and k = 1 s k = s 1 s .
 □
A fixed point f * generated by a sequence { T k } of different RB operators will be called a non-stationary fractal function (of class B ( X , Y ) ).
Remark 10.
Item (b) in Remark 3, of course, also applies to a sequence of RB operators { T k } , thus allowing the construction of more general fractal functions exhibiting different local behavior at different scales.
Example 1.
Let X : = [ 0 , 1 ] and Y : = R . Consider the two RB operators:
T 1 f ( x ) : = 2 x + 1 2 f ( 2 x ) , x [ 0 , 1 2 ) , 2 2 x + 1 2 f ( 2 x 1 ) , x [ 1 2 , 1 ] ,
and:
T 2 f ( x ) : = 2 x + 1 4 f ( 2 x ) , x [ 0 , 1 2 ) , 2 2 x + 1 4 f ( 2 x 1 ) , x [ 1 2 , 1 ] .
For both operators, l i ( x ) : = 1 2 ( x + i 1 ) , i = 1 , 2 .
It is known that T 1 k f τ , where τ denotes the Takagi function [11], and that T 2 k q , where q ( x ) = 4 x ( 1 x ) .
Consider the alternating sequence { T i } i N of RB operators given by:
T i : = T 1 , 10 ( j 1 ) < i 10 j 5 , T 2 , 10 j 5 < i 10 j , j N .
Two images of this hybrid attractor of the backward trajectory Ψ k starting with f 0 0 are shown in Figure 1.

6. Non-Stationary Fractal Interpolation

Let us now consider the case X : = [ 0 , 1 ] and Y : = R . Both spaces are metrizable under the usual Euclidean distance. In the following, we consider a sequence { T k } of RB operators of the form (25) acting on an appropriate metric subspace of B [ 0 , 1 ] : = B ( [ 0 , 1 ] , R ) . Our emphasis here lies in the construction of attractors that are continuous functions on [ 0 , 1 ] . For this purpose, we need to impose conditions on the RB operators that guarantee global continuity of the iterates across [ 0 , 1 ] .
For k N , let { l i k , k : i k N n k , k N } be a family of injections from [ 0 , 1 ] [ 0 , 1 ] generating a partition of [ 0 , 1 ] in the sense of (8) and (9). Assume w.l.o.g. that l 1 , k ( 0 ) = 0 and l n k , k ( 1 ) = 1 , and define:
x i k 1 , k : = l i k , k ( 0 ) , x i k , k : = l i k , k ( 1 ) , i k N n k ,
where x 0 , k : = 0 and x n k , k : = 1 . By relabeling, if necessary, we may assume that 0 = x 0 , k < < x i k 1 , k < x i k , k < x n k , k = 1 .
Let f C [ 0 , 1 ] be arbitrary. Define a metric subspace of C [ 0 , 1 ] by:
C * [ 0 , 1 ] : = { g C [ 0 , 1 ] : g ( 0 ) = f ( 0 ) g ( 1 ) = f ( 1 ) }
and note that C * [ 0 , 1 ] becomes a complete linear metric space when endowed with the metric induced by the sup-norm on continuous functions. Additionally, let b C * [ 0 , 1 ] be the unique affine function whose graph connects the points ( 0 , f ( 0 ) ) and ( 1 , f ( 1 ) ) :
b ( x ) = ( f ( 1 ) f ( 0 ) ) x + f ( 0 ) .
Further, let { P k } k N , where P k : = { ( x j k , f ( x j , k ) ) [ 0 , 1 ] × R : j = 0 , 1 , , n } , be a family of sets of points in [ 0 , 1 ] × R . For k N , define an RB operator T k : C * [ 0 , 1 ] C * [ 0 , 1 ] by:
T k g = f + i k = 1 n k S i k , k l i k , k 1 · ( g b ) l i k , k 1 χ l i k , k [ 0 , 1 ] ,
where { S i k , k } i k = 1 n k C [ 0 , 1 ] such that
sup k N max i k N i k S i k , k < 1 .
Note that we have the continuity of T k g at the points x i k , k [ 0 , 1 ] :
T k g ( x i k , k ) = T k g ( x i k , k + ) , i k { 1 , , n 1 } .
For,
T k g ( x i k , k ) = f ( x i k , k ) + S i k , k l i k , k 1 ( x i k , k ) · ( g b ) l i k , k 1 ( x i k , k ) = f ( x i k , k ) + S i k , k ( 1 ) · ( f b ) ( 1 ) = f ( x i k , k )
and
T k g ( x i k , k + ) = f ( x i k , k + ) + S i k + 1 , k l i k + 1 , k 1 ( x i k , k + ) · ( g b ) l i k + 1 , k 1 ( x i k , k + ) = f ( x i k , k ) + S i k + 1 , k ( 0 ) · ( f b ) ( 0 ) = f ( x i k , k ) .
Therefore, T k g C * [ 0 , 1 ] , and T k g interpolates P k in the sense that:
T k g ( x i k , k ) = f ( x i k , k ) , i k N n k .
Remark 11.
Denote by ( [ 0 , 1 ] , L k ) the IFS given by the maps L k : = { l i k , k : i k N n k } , and observe that, for each k N , the attractor of ( [ 0 , 1 ] , L k ) is the interval [ 0 , 1 ] . The invariant set, in H ( [ 0 , 1 ] ) , for L k is given by [ 0 , 1 ] . Hence, all backward trajectories L 1 L k converge to [ 0 , 1 ] as k (as do all forward trajectories).
Proposition 3.
A nonempty closed invariant set for { T k } k N is given by the closed ball in C * [ 0 , 1 ] ,
I = g C * [ 0 , 1 ] : g f + s b 1 s ,
where s is given by (30).
Proof. 
Using the form (24) for the functions q i k , k , we obtain from (31) the estimate q i k , k f + s b , which by Proposition 2 yields the result. □
In connection with Theorem 3, the above arguments prove the next result.
Theorem 4.
Let { T k } k N be a sequence of RB operators of the form (33), each of whose elements acts on the complete metric space ( C * [ 0 , 1 ] , d ) where f C * [ 0 , 1 ] is arbitrary and b is given by (32). Further, let the family of functions { S i k , k } C [ 0 , 1 ] satisfy (30). Then, the backward trajectories Ψ k ( f 0 ) converge to a function f * I , for any f 0 I . As f 0 one may choose f or b.
We refer to the fixed point f * C * [ 0 , 1 ] as a continuous non-stationary fractal interpolation function.
To illustrate the above results, we refer to Remark 3(c) and present the following example.
Example 2.
Here, we consider the two RB operators T i : C [ 0 , 1 ] C [ 0 , 1 ] , i = 1 , 2 , given by:
( T 1 f ) ( x ) = 1 2 f ( 4 x ) , x [ 0 , 1 4 ) , 1 2 + 1 2 f ( 4 x 1 ) , x [ 1 4 , 1 2 ) , 1 2 f ( 4 x 2 ) , x [ 1 2 , 3 4 ) , 1 2 + 1 2 f ( 4 x 3 ) , x [ 3 4 , 1 ] ,
and
( T 2 f ) ( x ) : = 3 4 f ( 2 x ) , x [ 0 , 1 2 ) , 3 4 + 1 4 f ( 2 x 1 ) , x [ 1 2 , 1 ] .
The RB operators T 1 and T 2 generate Kiesswetter’s fractal function [12] and a Casino function [13], respectively.
Consider again the alternating sequence { T i } i N of RB operators given by:
T i : = T 1 , 10 ( j 1 ) < i 10 j 5 , T 2 , 10 j 5 < i 10 j , j N .
Two images of the hybrid attractor of the backward trajectory Ψ k starting with the function f 0 ( x ) = x , x [ 0 , 1 ] , are shown below in Figure 2.
Remark 12.
Theorem 2 holds in the case of non-stationary fractal functions as well. For k N , a non-stationary IFS is associated with T k by setting:
w i k , k ( x , y ) : = ( l i k , k ( x ) , f l i k , k ( x ) + S i k , k ( x ) · ( y b ) ) .
The conditions imposed on S i k , k and the form of the second component allow the immediate transfer of the proof of Theorem 2. Hence, even in the non-stationary case, one may choose the geometry (IFS) or the analytic (RB operator) approach when defining non-stationary fractal functions.

7. Non-Stationary Fractal Functions in Bochner–Lebesgue Spaces

In this section, we construct non-stationary fractal functions in the Bochner–Lebesgue spaces L p with 0 < p . To this end, suppose that X is a closed subspace of a Banach space X and X : = ( X , Σ , μ ) a measure space. Further, suppose that ( Y , · Y ) is a Banach space.
Recall that the Bochner–Lebesgue space L p ( X , Y ) , 1 p is comprised of all Bochner measurable functions f : X Y such that:
f L p ( X , Y ) : = X f ( x ) Y p d μ ( x ) 1 / p < , 1 p < ,
and
f L ( X , Y ) : = ess sup x X f ( x ) Y < , p = .
For 0 < p < 1 , the spaces L p ( X , Y ) are defined using a metric instead of a norm to obtain completeness. More precisely, for 0 < p < 1 , define d p : L p ( X , Y ) × L p ( X , Y ) R by:
d p ( f , g ) : = f g Y p .
Then, ( L p ( X , Y ) , d p ) becomes an F-space (note that the inequality ( a + b ) p a p + b p holds for all a , b 0 ). For more details, we refer to [14,15].
In order to work in both cases simultaneously, we define ρ p : L p ( X , Y ) × L p ( X , Y ) R by:
ρ p ( g , h ) : = g h L p ( X , Y ) , 1 p , g h Y p , 0 < p < 1 ,
with the usual modification for p = .
We use the notation and terminology of Section 5 and assume that:
(A1)
{ q i k , k : i k N n k , k N } L p ( X , Y ) ;
(A2)
{ S i k , k : i k N n k , k N } L p ( X , R ) ;
(A3)
{ l i k , k : i k N n k , k N } is a family of μ -measurable diffeomorphisms X X generating for each k N a partition of X in the sense of (8) and (9).
If we define for each k N an RB operator T k on L p ( X , Y ) of the form (28), whose maps satisfy assumptions (A1), (A2), and (A3), then a straightforward computation shows that T k has the following Lipschitz constants on L p ( X , Y ) :
ρ p ( T k g , T k h ) i k = 1 n k S i k , k L p ( X , Y ) p · L i k , k 1 / p , ( 1 p < ) max i k N n k S i k , k L ( X , Y ) , ( p = ) i k = 1 n k S i k , k L p ( X , Y ) p · L i k , k , ( 0 < p < 1 ) ρ p ( g , h ) ,
where L i k , k denotes the Lipschitz constant of D l i k , k 1 and D the Fréchet derivative on X.
Now, set:
γ p : = sup k N i k = 1 n k S i k , k L p ( X , Y ) p · L i k , k 1 / p , 1 p < sup k N max i k N n k S i k , k L ( X , Y ) , p = sup k N i k = 1 n k S i k , k L p ( X , Y ) p · L i k , k , 0 < p < 1 .
Imposing the condition:
sup k N max i k N n k ρ p ( q i k , k , 0 ) < M ,
for some M > 0 and further requiring that:
Lip T k γ p < 1 , k N ,
yield by Proposition 2 an invariant set for { T k } k N , namely the closed L p -ball:
I = B r ( 0 ) with r = M / ( 1 γ p ) .
The above elaborations now prove the following theorem.
Theorem 5.
Let { T k } k N be a sequence of RB operators of the from (28) mapping L p ( X , Y ) into itself. Further, suppose that the Lipschitz constant of T k satisfies (37) and that the maps { q i k , k } fulfill (36). Then, the backward trajectories { Ψ k } k N of { T k } k N converge for any initial f 0 I to a unique attractor f * I , where I is the ball in L ( X , Y ) of radius M / ( 1 γ p ) centered at zero.
Proof. 
Only (7) needs to be established. This, however, carries over directly from the proof of Theorem 3 with γ p instead of s. □
The attractor f * : X Y whose existence is guaranteed by Theorem 5 is called a non-stationary fractal function of class L p ( X , Y ) .

Funding

This research received no external funding.

Acknowledgments

The author would like to thank Nira Dyn and David Levin for two visits to the Mathematics Department of Tel Aviv University, where the mathematical ideas for this article originated.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Barnsley, M.F. Fractals Everywhere; Academic Press: Orlando, FL, USA, 1988. [Google Scholar]
  2. Massopust, P.R. Interpolation and Approximation with Splines and Fractals; Oxford University Press: Oxford, MA, USA, 2010. [Google Scholar]
  3. Massopust, P.R. Fractal Functions, Fractal Surfaces, and Wavelets, 2nd ed.; Academic Press: San Diego, CA, USA, 2016. [Google Scholar]
  4. Levin, D.; Dyn, N.; Viswanathan, P. Non-stationary versions of fixed-point theory, with applications to fractals and subdivision. J. Fixed Point Theory Appl. 2019, 21, 1–25. [Google Scholar] [CrossRef]
  5. Dira, N.; Levin, D.; Massopust, P. Attractors of Trees of Maps and of Sequences of Maps between Spaces and Applications to Subdivision. Available online: http://arxiv.org/abs/1902.03407 (accessed on 9 February 2019).
  6. Hutchinson, J.E. Fractals and self-similarity. Indiana Univ. Math. J. 1981, 30, 713–747. [Google Scholar] [CrossRef]
  7. Barnsley, M.F.; Hutchinson, J.E.; Stenflo, Ö. V-variable fractals: Fractals with partial self-similarity. Adv. Math. 2008, 218, 2015–2088. [Google Scholar] [CrossRef]
  8. Rolewicz, S. Metric Linear Spaces; Kluwer Academic: Warsaw, Poland, 1985. [Google Scholar]
  9. Barnsley, M.F.; Hegland, M.; Massopust, P.R. Numerics and Fractals. Bull. Inst. Math. Acad. Sin. (N.S.) 2014, 9, 389–430. [Google Scholar]
  10. Barnsley, M.F. Fractal functions and interpolation. Constr. Approx. 1986, 2, 303–329. [Google Scholar] [CrossRef]
  11. Takagi, T. A simple example of the continuous function without derivative. Proc. Phys. Math. Soc. Jpn. 1903, 1, 176–177. [Google Scholar]
  12. Kiesswetter, K. Ein einfaches Beispiel für eine Funktion welche überall stetig und nicht differenzierbar ist. Math. Phys. Semesterber. 1966, 13, 216–221. [Google Scholar]
  13. Dubins, L.E.; Savage, L.J. Inequalities for Stochastic Processes; Dover Publications: New York, NY, USA, 1976. [Google Scholar]
  14. Rudin, W. Functional Analysis; McGraw–Hill: New York, NY, USA, 1991. [Google Scholar]
  15. Adams, R.; Fourier, J. Sobolev Spaces, 2nd ed.; Academic Press: New York, NY, USA, 2003. [Google Scholar]
Figure 1. The hybrid τ q attractor. It is smooth at one scale (Left), but fractal at another (Right).
Figure 1. The hybrid τ q attractor. It is smooth at one scale (Left), but fractal at another (Right).
Mathematics 07 00666 g001
Figure 2. The hybrid Kiesswetter–Casino attractor. The graph of the Casino function (Right) contains at the fine scale images of the Kiesswetter function (Left).
Figure 2. The hybrid Kiesswetter–Casino attractor. The graph of the Casino function (Right) contains at the fine scale images of the Kiesswetter function (Left).
Mathematics 07 00666 g002

Share and Cite

MDPI and ACS Style

Massopust, P. Non-Stationary Fractal Interpolation. Mathematics 2019, 7, 666. https://doi.org/10.3390/math7080666

AMA Style

Massopust P. Non-Stationary Fractal Interpolation. Mathematics. 2019; 7(8):666. https://doi.org/10.3390/math7080666

Chicago/Turabian Style

Massopust, Peter. 2019. "Non-Stationary Fractal Interpolation" Mathematics 7, no. 8: 666. https://doi.org/10.3390/math7080666

APA Style

Massopust, P. (2019). Non-Stationary Fractal Interpolation. Mathematics, 7(8), 666. https://doi.org/10.3390/math7080666

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

Article Metrics

Back to TopTop