A CLASS OF FRACTAL FUNCTIONS

Ljubisa Koci
1
, Marjan Mateji
1

ID: 19-43


1
Faculty of Electronic Engineering, University of Nis, Nis, Serbia and Montenegro

Abstract A class of fractal interpolating functions defined
on the set of knots } ,..., 0 | ] , {[ n i y x Y
i i
= = is
investigated. Any function from the class is the fixed point of
Iterated Function System containing piecewise affine
function } {
i
w , with nodes defined by pairs of barycentric
coordinates.
1. INTRODUCTION
In this paper we consider a particular type of Iterative
Function System (IFS) that generates a fractal interpolant to
the data set
} , ,..., 1 , 0 ), , {(
1 +
< = =
i i i i
x x n i y x Y
. The
classic interpolation functions are usually generated by the
IFS that contains affine functions [1]
w
i
(x)=

i
i
c
a

(

(
i
d
0
x+
(

i
i
f
e
, x=
(

y
x
, . ,..., 1 n i =
It is known [1] that parameters
i i i i
f e c a , , , are fully
determined by the interpolation data Y , while
i
d are free
parameters, with the only restriction , 1 | | <
i
d for all i .
Consequently, parameters } ,..., {
1 n
d d are called vertical
scaling factors.
If is chosen such that 0< <min
i
((1-|a
i
|)/(1+|c
i
|)), and
since
i
w is a mapping in the space supplied with the norm
| | | | || || y x x

+ = , it follows that 1 0 <

i
a , and
therefore { }
n
w w R ,..., ;
1
2
= is a hyperbolic IFS.
Let ) (
2
R be a set of nonempty compact subsets of
2
R
and

h the Hausdorff metric on ) (

2
R generated by

.
Let
U
n
i
w W
1
) ( ) ( = , ) ( :
2
R W ) (
2
R be the
Hutchinson operator. Then W is a contraction of the
complete metric space ) ), ( (
2

h R . Its fixed
point,
2
R F
Y
, is called attractor oh the IFS . The IFS
proposed in this paper has a larger set of parameters
{ } m j n i
ij ij
,..., 1 , ,..., 1 ), , ( = = instead. In addition,
only two interpolating nodes suffice, while in the classic
scheme the existence of attractor is provided by three nodes at
least. More specifically, the proposed IFS is
{ }
n
w w R ,..., ;
1
2
= where | | | |
i i n i
x x x x w , , :
1 0
is a
piecewise affine transformation with nodes from the set
| | R x x
i i

,
1
, which position is determined by the pairs of
barycentric coordinates { } m j
ij ij
,..., 1 ), , ( = .
This construction approves the name for the new IFS piece-
wise affine IFS. In comparison to classic affine IFS, the
piecewise affine IFS has more free parameters and
accordingly, bigger flexibility.
2. ONE INTERNAL NODE PIECEWISE IFS
Assume that
| | R x x I
n
= ,
0
and a set of data
} ,..., 1 , 0 , ) , {( n i R I y x Y
i i
= =
are given.
Let an additional pair
) , (
i i
| | R 1 , 0
be given.
With ) , (
i i
the node
2
) , ( R
i i
can be associated
such that
), (
1 1
+ =
i i i i i
x x x ) (
1 1
+ =
i i i i i
y y y
.
. ,..., 2 , 1 n i =

Clearly
| | . , ) , (
1
R x x
i i i i




Let for
n i ,..., 2 , 1 =

) ( ) ( ) (
) (
k
i
k
i
k
i
B x A x w + =
, , 2 , 1 = k (1)
are affine maps where

(
(

=
(

=
) (
) (
) (
) ( ) (
) (
) (
,
0
k
i
k
i k
i
k
i
k
i
k
i k
i
f
e
B
d c
a
A (2)

, ,..., 2 , 1 n i = , 2 , 1 = k
and where coefficients
) ( ) ( ) ( ) (
, , ,
k
i
k
i
k
i
k
i
f e c a are determined
by the following conditions:
(

=
(

1
1
0
0 ) 1 (
i
i
i
y
x
y
x

,
(

=
(

i
i
n
n
i
y
x

) 1 (
;
(

=
(

i
i
i
y
x

0
0 ) 2 (
,
(

=
(

i
i
n
n
i
y
x
y
x
) 2 (

.
One yields
We obtain:
0
1 ) 1 (
x x
x
a
n
i i
i

,
0
) 2 (
x x
x
a
n
i i
i

=

,

0
0 1 ) 1 (
x x
x x x
e
n
i i n
i

=


,
0
0 ) 2 (
x x
x x x
e
n
i i n
i

=

,
0
0 1
0
1 ) 1 (
x x
y y
d
x x
y
c
n
n
i
n
i i
i

,
0
0 2
0
) 2 (
x x
y y
d
x x
y
c
n
n
i
n
i i
i

=

,
,
0
0 0 1
0
0 1 ) 1 (
x x
y x y x
d
x x
x y x
f
n
n n
i
n
i i n
i

=



,
0
0 0 2
0
0 ) 2 (
x x
y x y x
d
x x
y x x
f
n
n n
i
n
i i n
i

=



where 1 , 0
) 2 ( ) 1 (
<
i i
d d are arbitrary real numbers. In this
way a new set of maps can be established as
. ,..., 2 , 1 ,
) 2 ( ) 1 (
n i w w w
i i i
= =

The following theorem sets up conditions for the existence of
the graph of interpolated fractal function passing through the
data.
Theorem 1. Let n be positive integer, and let
} ,..., ; {
1
2
n
w w R = denote the IFS defined above,
associated with the data set } ,..., 0 | ) , {( n i y x
i i
= and the
set of parameters } ,..., 1 | ) , {( n i
i i
= . Then, there is a
metric d on R
2
, equivalent to Eucledean metric d
e
, such
that the IFS is hyperbolic with respect to d. So, there is a
unique nonempty compact set
2
R G such that
U
n
i
i
G w G
1
). (
=
=
Proof. Since
i
w is defined by ,
) 2 ( ) 1 (
i i i
w w w =
,
i=1,...,n,
it is sufficient to show that there is a metric d on
2
R , which
is equivalent to the Euclidean metric, so that
) ,..., 1 , 2 , 1 (
) (
n i k w
k
i
= = is a contraction with respect to
d . By that,w
i
as union of two contractions will be
contraction with respect to the same metric.
We define metric d on R
2
by
| | | | )) , ( ), , ((
2 1 2 1 2 2 1 1
y y x x y x y x d + = , (3)
where is a positive real number that will be specified.
Now, it will be shown that there are constants
< < <
2 1 2 1
0 , , c c c c , such that
)) , ( ), , (( )) , ( ), , ((
2 2 1 1 2 2 1 1 1
y x y x d y x y x d c
e

)), , ( ), , ((
2 2 1 1 2
y x y x d c
which means that these metrics are equivalent. The following
double inequality holds for all R y x ,
. | | | | |) | | max(|
2 2
y x y x y x + + +
On the other hand

+
+

1
| | | |
|) | |, max(|
y x
y x
and
) ( , | | | |
1
1 | | | |
1
| | | | | | | | y x y x y x y x

\
|
|
.
|
+ = + + + +
which yields the double inequality
) ( ) ( . | | | |
1
1 | | | |
1
1
2 2
y x y x y x

\
|
|
.
|
+ + +
+

Taking
2 1
x x x = and
2 1
y y y = one obtains
)) , ( ), , (( )) , ( ), , ((
1
1
2 2 1 1 2 2 1 1
y x y x d y x y x d
e

+

)). , ( ), , ((
1
1
2 2 1 1
y x y x d

\
|
|
.
|
+

Using (1) and (3) it follows:
) 4 ( . | | | | |) | | (|
| ) ( ) ( | | || |
)) , ( ), , ( (
2 1
) 1 (
2 1
) 1 ( ) 1 (
2 1
) 1 (
2 1
) 1 (
2 1
) 1 (
2 2
) 1 (
1 1
) 1 (
y y d x x c a
y y d x x c x x a
y x w y x w d
i i i
i i i
i i
+ +
+ + =
=



Notice that . 1 | | / | | | |
0 1
) 1 (
< =

x x x a
n i i i

If , 0 ...
) 1 ( ) 1 (
1
= = =
n
c c then 1 = is to be chosen.
Otherwise,
.
} ,..., 1 |; | 2 max{
} ,..., 1 |; | 1 min{
) 1 (
) 1 (
n i c
n i a
i
i
=
=
=
From (4) it follows
)), , ( ), , (( } , max{ | | | |
)) , ( ), , ( (
2 2 1 1 2 1 2 1
2 2
) 1 (
1 1
) 1 (
y x y x d a y y x x a
y x w y x w d
i i
+
where
) (
. 1 } ,..., 1 |; max{|
, 1 } ,..., 1 |; max{| 1
2
1
) 1 (
) 1 (
< = =
< = + =
n i d
n i a a
i
i

Applying this to mapp ,
) 2 (
i
w we obtain the same result. So,
the map
) 2 ( ) 1 (
i i i
w w w = is a contraction.
Theorem 2. Let n be positive integer, and let
} ,..., ; {
1
2
n
w w R = denote the IFS defined above,
associated with the data set } ,..., 0 | ) , {( n i y x
i i
= and the
vertical scaling factors
) (k
i
d obey , 1 0
) (
<
k
i
d all i . Let
2
R G denotes the attractor of the IFS. Then G is a graph
of a continuous function R x x f
n
] , [ :
0
which
interpolates the data } ,..., 0 | ) , {( n i y x
i i
= . That is
]}, , [ : )) ( , {(
0 n
x x x x f x G =
where . ,..., 1 , 0 , ) ( n i for y x f
i i
= =
Proof. Let denotes the set of continuous functions
R x x f
n
] , [ :
0
such that
0 0
) ( y x f = and
. ) (
n n
y x f = Define a metric d on parameters
} ,..., 1 | ) , {( n i
i i
= . Then, there is a metric by
]} , [ |: ) ( ) ( max{| ) , (
0 n
x x x x g x f g f d =
for all g f , in . Now ) , ( d is a complete metric space.
Define a map : T by
, )) ( ( ) ( ) )( (
) 1 (
1
) 1 ( ) 1 (
1
) 1 ( ) 1 (
i i i i i
f x l f d x l c x Tf + + =


for ] , [
1 i i
x x

,
, )) ( ( ) ( ) )( (
) 2 (
1
) 2 ( ) 2 (
1
) 2 ( ) 2 (
i i i i i
f x l f d x l c x Tf + + =


for ], , [
i i
x x where ] , [ ] , [ :
1 0
) 1 (
i i n i
x x x l

,
] , [ ] , [ :
0
) 2 (
i i n i
x x x l are invertibile transformations
. ,..., 1 , 2 , 1 , ) (
) ( ) ( ) (
n i k e x a x l
k
i
k
i
k
i
= = + =
Now verify that T maps into itself. Let . f
0
) 1 (
0
) 1 (
0
) 1 (
) 1 (
0
) 1 (
0
) 1 (
) 1 (
0
1
) 1 ( ) 1 (
0
1
) 1 ( ) 1 (
0
) (
)) ( ( ) ( ) )( (
y f y d x c
f x f d x c
f x l f d x l c x Tf
i i i
i i i
i i i i i
= + + =
+ + =
+ + =


and
.
) (
)) ( ( ) ( ) )( (
) 2 ( ) 2 ( ) 2 (
) 2 ( ) 2 ( ) 2 (
) 2 (
1
) 2 ( ) 2 (
1
) 2 ( ) 2 (
n i n i n i
i n i n i
i n i i n i i n
y f y d x c
f x f d x c
f x l f d x l c x Tf
= + + =
+ + =
+ + =


Also, ) )( ( x Tf is continuous on the interval ) , (
1 i i
x x

, for
. ,..., 1 n i = It remains to show that ) )( ( x Tf is continuous at
each of the points . ,...,
1 1 n
x x A each of the these points the
value of ) )( ( x Tf is apparently defined in two different
ways. For }, 1 ,..., 2 , 1 { n i we have
, ) (
)) ( ( ) ( ) )( (
) 1 (
1
) 1 (
1
) 1 (
1
) 1 (
1
1
) 1 (
1
) 1 (
1
1
) 1 (
1
) 1 (
1
i i i i i i
i i i i i i i i
y f x f d x c
f x l f d x l c x Tf
= + + =
+ + =
+ + +
+

+ +

+ +

and
, ) (
)) ( ( ) ( ) )( (
) 2 ( ) 2 ( ) 2 (
) 2 (
1
) 2 ( ) 2 (
1
) 2 ( ) 2 (
i i i i i i
i i i i i i i i
y f x f d x c
f x l f d x l c x Tf
= + + =
+ + =


so we conclude that T does indeed take into .
Now, one have to prove that T is a contraction mapping on
the metric space ). , ( d Let g f , and
}. ,..., 2 , 1 { n i Then for ] , [
1 i i
x x

) , ( | |
| )) ( ( )) ( ( || | | ) )( ( ) )( ( |
) 1 (
1
) 1 (
1
) 1 ( ) 1 (
g f d d
x l g x l f d x Tg x Tf
i
i i i

=


and for all ] , [
i i
x x
). , ( | |
| )) ( ( )) ( ( || | | ) )( ( ) )( ( |
) 2 (
1
) 2 (
1
) 2 ( ) 2 (
g f d d
x l g x l f d x Tg x Tf
i
i i i

=

It follows that ), , ( ) , ( g f d Tg Tf d where
}. ,..., 0 , 2 , 1 |, max{|
) (
n i k d
k
i
= = = So, : T
is a contraction mapping, then it implies that T possesses a
unique fixed point in . That means that there exists a
function f such that ) ( ) )( ( x f x Tf = for all
]. , [
0 n
x x x Let
1
G denotes the graph of . f Also we have
], , [ , ) ( ) )( (
1
) 1 ( ) 1 ( ) 1 ( ) 1 ( ) 1 (
i i i i i i i
x x f x f d x c e x a Tf

+ + = +
], , [ , ) ( ) )( (
) 2 ( ) 2 ( ) 2 ( ) 2 ( ) 2 (
i i i i i i
x x f x f d x c e x a Tf + + = +
which implies that
U
n
i
i
G w G
1
1 1
). (
=
= But
1
G is a nonempty
compact subset of .
2
R By the theorem 1 there is only one
nonempty compact set G , the attractor of the IFS defined
above, which obeys the latter conditions. It follows that
.
1
G G =

Figure 1 Interpolants for the data )} 5 . 0 , 1 ( ), 0 , 0 {( , for
vector ) 5 . 0 , 5 . 0 ( = d with 55 . 0 = and different
On Figure 1 a typical case of generalized fractal interpolats
are presented for two interpolating points.
3. GENERAL CASE
In the previous part, the case when one node is added is
presented, but one can have m additional nodes in each
]. , [
1 i i
x x

These nodes are given by baricentric coordinates
}. ,..., 1 , ,..., 1 | ) , {( m j n i
ij ij
= = Now is
), (
1 1
+ =
i i ij i ij
x x x
), (
1 1
+ =
i i ij i ij
y y y
, ,..., 1 , ,..., 1 m j n i = = and define
. , , ,
1 1 , 0 1 1 , 0 + + + +
= = = =
i n i i i i n i i i
y y x x
In this case piecewise affine maps
, ) (
) ( ) ( ) ( k
i
k
i
k
i
B x A x w + =
, ,..., 1 m k =
satisfy the following conditions
(

=
(

1 ,
1 ,
0
0 ) (
k i
k i
k
i
y
x

,
(

=
(

k i
k i
n
n k
i
y
x
,
,
) (

(5)
for . ,..., 1 , 1 ,..., 1 n i m k = + = So, define
U
1
1
) (
+
=
=
m
k
k
i i
w w (6)
and all of the coefficients
) ( ) ( ) ( ) (
, , ,
k
i
k
i
k
i
k
i
f e c a are
determined from the conditions (5). The following theorem
deals with the general case.
Theorem 3. Let the set of data } ,..., 0 | ) , {( n i y x
i i
= and
additional set of parameters } ,..., 1 | ) , {( m j
ij ij
= are
given. If } ,..., ; {
1
2
n
w w R = denotes the IFS defined
above, then there is a unique nonempty compact set
2
R G such that
U
n
i
i
G w G
1
). (
=
=
Proof. It's similar as the proof of the theorem 1. So, first
prove that since
) (k
i
w is contraction in some metric which is
equivalent to the Euclidean metric. That metric can be
defined as (3). Now
. | | | | |) | | (|
| ) ( ) ( | | || |
)) , ( ), , ( (
2 1
) (
2 1
) ( ) (
2 1
) (
2 1
) (
2 1
) (
2 2
) (
1 1
) (
y y d x x c a
y y d x x c x x a
y x w y x w d
k
i
k
i
k
i
k
i
k
i
k
i
k
i
k
i
+ +
+ + =
=

(7)
Notice that . 1 | | / | | | |
0 , 1 ,
) (
< =

x x a
n k i k i
k
i

If , 0 ...
) ( ) (
1
= = =
k
n
k
c c then 1 = is to be chosen.
Otherwise,
.
} 1 ,..., 1 , ,..., 1 |; | 2 max{
} 1 ,..., 1 , ,..., 1 |; | 1 min{
) 1 (
) (
+ = =
+ = =
=
m k n i c
m k n i a
i
k
i

From (7) it follows
)), , ( ), , (( } , max{ | | | |
)) , ( ), , ( (
2 2 1 1 2 1 2 1
2 2
) (
1 1
) (
y x y x d a y y x x a
y x w y x w d
k
i
k
i
+
where
) (
. 1 } 1 ,..., 1 , ,..., 1 |; max{|
, 1 } 1 ,..., 1 , ,..., 1 |; max{| 1
2
1
) (
) (
< = = =
< = = + =
m k n i d
m k n i a a
k
i
k
i

So, the map
U
1
1
) (
+
=
=
m
k
k
i i
w w is a contraction.
REFERENCES
[1] Barnsley, M. F.,"Fractal Functions and Interpolation",
Constr. Approx. 2, pp. 303-329, 1986.
[2] Hutchinson, J.E.,"Fractals and self similarity", Indian. J.,
Math, 30, pp. 713-747, 1981.
[3] Barnsley, M. F.,"Fractals Everywhere", Academic Press,
1988.
[4] Ljubisa M. Kocic, Alba C. Simoncelli,"Properties of a
Fractal Interpolation Scheme", Rend. Acc. Sc. Fis. Mat.
Napoli, pp.281-292.,66.,1999.
[5] Ljubisa M. Kocic, Alba C. Simoncelli,"Notes on fractal
interpolation", Novi Sad J. Math., pp.59-68.,Vol. 30, No.
3, 2000.
[6] Ljubisa M. Kocic, Alba C. Simoncelli,"Functional
Equations for Fractal Interpolants", Facta Univ. (Nis)
Ser. Math. Inform. 15, pp. 37-48., 2000.
[7] Ljubisa M. Kocic, Alba C. Simoncelli,"About affine
invariance of fractal interpolants", Rendiconti del Circolo
Matematico di Palermo, Serie II, Suppl. 68, pp. 569-
583., 2002.
[8] Ljubisa M. Kocic,"Data Variation in Fractal
interpolation", FILOMAT (Nis) 17, pp. 79-84., 2003.

Sadrzaj Proucavana je klasa fraktalnih funkcija koje
interpoliraju skup podataka } ,..., 0 | ] , {[ n i y x Y
i i
= = . Svaka
funkcija iz ove klase je fiksna tacka Iterativnog Sistema
Funkcija koji sadrzi deo po deo afine funkcije } {
i
w , sa
cvorovima definisanim parovima baricentricnih
koordinata3.
O JEDNOJ KLASI FRAKTALNIH
FUNKCIJA
Ljubisa Koci, Marjan Mateji