Algorithms generating images of attractors of generalized iterated function systems
From MaRDI portal
Fractals (28A80) Notions of recurrence and recurrent behavior in topological dynamical systems (37B20) Attractors and repellers of smooth dynamical systems and their topological structure (37C70) Fixed-point and coincidence theorems (topological aspects) (54H25) Numerical nonlinear stabilities in dynamical systems (65P40)
Abstract: The paper is devoted to searching algorithms which will allow to generate images of attractors of emph{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 , we consider mappings form the Cartesian product to ). Two presented algorithms are counterparts of classical emph{deterministic algorithm} and so-called emph{chaos game}. The third and fourth one one is fitted to special kind of GIFSs - to emph{affine} GIFS, which are, in turn, also investigated.
Recommendations
- A multiresolution algorithm to generate images of generalized fuzzy fractal attractors
- Generalized K-iterated function systems and their attractors
- Attractors of generalized IFSs that are not attractors of IFSs
- scientific article; zbMATH DE number 1210921
- "Chaos Games" for Iterated Function Systems with Grey Level Maps
Cites work
- scientific article; zbMATH DE number 3964277 (Why is no real title available?)
- scientific article; zbMATH DE number 194082 (Why is no real title available?)
- scientific article; zbMATH DE number 3498502 (Why is no real title available?)
- scientific article; zbMATH DE number 647312 (Why is no real title available?)
- A FRACTAL APPROXIMATION OF CURVES
- A code space for a generalized IFS
- A new approximation procedure for fractals
- A projective algorithm for approximation of fractal sets
- A topological version of iterated function systems
- Applications of fixed point theorems in the theory of generalized IFS
- Approximation of infinite dimensional fractals generated by integral equations
- Approximations of fractal sets
- Attractors of generalized IFSs that are not attractors of IFSs
- Generalized IFSs on noncompact spaces
- Generalized iterated function systems with place dependent probabilities
- On a certain generalisation of the iterated function system
- On the connectivity of the attractors of recurrent iterated function systems
- Recurrent iterated function systems
- The chaos game revisited: Yet another, but a trivial proof of the algorithm's correctness
- The ergodic theorem for a new kind of attractor of a GIFS
- The shift space of a recurrent iterated function system
- Topological version of generalized (infinite) iterated function systems
Cited in
(16)- Fuzzy-set approach to invariant idempotent measures
- Approximating the attractor set of iterated function systems of order \(m\) by \(\alpha\)-dense curves
- Attractors of generalized IFSs that are not attractors of IFSs
- On hyperbolic affine generalized infinite iterated function systems
- A multiresolution algorithm to generate images of generalized fuzzy fractal attractors
- Contractive affine generalized iterated function systems which are topologically contracting
- The ergodic theorem for a new kind of attractor of a GIFS
- A new algorithm that generates the image of the attractor of a generalized iterated function system
- Computer Generated Images for Quadratic Rational Maps with a Periodic Critical Point
- Making the computation of approximations of invariant measures and its attractors for IFS and GIFS, through the deterministic algorithm, tractable
- On generalized iterated function systems defined on \(\ell_{\infty}\)-sum of a metric space
- Semifractals from multifunctions on product spaces and generalized iterated function systems
- A multiresolution algorithm to approximate the Hutchinson measure for IFS and GIFS
- The canonical projection associated with certain possibly infinite generalized iterated function systems as a fixed point
- An application of Edelstein's contraction principle: the attractor of a graph-directed generalized iterated function system
- Weakly contractive iterated function systems and beyond: a manual
This page was built for publication: Algorithms generating images of attractors of generalized iterated function systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329321)