Constructive Approximation

, Volume 5, Issue 1, pp 3–31

Recurrent iterated function systems

  • Michael F. Barnsley
  • John H. Elton
  • Douglas P. Hardin
Article

DOI: 10.1007/BF01889596

Cite this article as:
Barnsley, M.F., Elton, J.H. & Hardin, D.P. Constr. Approx (1989) 5: 3. doi:10.1007/BF01889596
  • 661 Downloads

Abstract

Recurrent iterated function systems generalize iterated function systems as introduced by Barnsley and Demko [BD] in that a Markov chain (typically with some zeros in the transition probability matrix) is used to drive a system of mapswj:KK,j=1, 2,⋯,N, whereK is a complete metric space. It is proved that under “average contractivity,” a convergence and ergodic theorem obtains, which extends the results of Barnsley and Elton [BE]. It is also proved that a Collage Theorem is true, which generalizes the main result of Barnsleyet al. [BEHL] and which broadens the class of images which can be encoded using iterated map techniques. The theory of fractal interpolation functions [B] is extended, and the fractal dimensions for certain attractors is derived, extending the technique of Hardin and Massopust [HM]. Applications to Julia set theory and to the study of the boundary of IFS attractors are presented.

AMS classification

28D99 41A99 58F11 60F05 60G10 60J05 

Key words and phrases

Iterated function systems Attractor Random maps Markov chain Ergodic Lyapunov exponent Fractal Dimension 

Copyright information

© Springer-Verlag New York Inc 1989

Authors and Affiliations

  • Michael F. Barnsley
    • 1
  • John H. Elton
    • 1
  • Douglas P. Hardin
    • 1
  1. 1.School of MathematicsGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations