Algorithms generating images of attractors of generalized iterated function systems

2016/01/13 by Partycja Jaros, Jaros, Partycja, Łukasz Maślanka +3
Mathematics · #37C70 #Dynamical Systems (math.DS) #FOS: Mathematics #Primary: 28A80 #math.DS #msc:28A80 #msc:37C25 #msc:37C70 #secondary: 37C25

paper · pdf · doi:10.48550/arxiv.1601.03200

22 pages, 6 figures

arxiv created 2016/01/13 · arxiv updated 2016/01/14

Abstract

The paper is devoted to searching algorithms which will allow to generate images of attractors of generalized iterated function systems (GIFS in short), which are certain generalization of classical iterated function systems, defined by Mihail and Miculescu in 2008, and then intensively investigated in the last years (the idea is that instead of selfmaps of a metric space X, we consider mappings form the Cartesian product X×...× X to X). Two presented algorithms are counterparts of classical deterministic algorithm and so-called chaos game. The third and fourth one one is fitted to special kind of GIFSs - to affine GIFS, which are, in turn, also investigated.

Related

• A new algorithm that generates the image of the attractor of a generalized iterated function system
• Zero-dimensional compact metrizable spaces as attractors of generalized iterated function systems
• The Chaos Game on a General Iterated Function System
• On a typical compact set as the attractor of generalized iterated function systems of infinite order
• On generalized iterated function systems defined on ℓ_∞-sum of a metric space