Random iteration for non-expansive iterated function systems: derandomised algorithm

DOI10.1504/IJANS.2014.068267MaRDI QIDQ258020zbMATH OpenOpenAlexWikidataFDO

Authors Krzysztof Leśniak

Publication date 17 March 2016

Published in International Journal of Applied Nonlinear Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijans.2014.068267

zbMATH Keywords

chaos gamederandomised algorithmdisjunctive sequencesiterated function systemsnon-expansive mapsrandom iterationstrict attractor

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Dynamical aspects of attractors and their bifurcations (37G35) General theory of random and stochastic dynamical systems (37H05)

Recommendations

• Random iteration for infinite nonexpansive iterated function systems
• A chaos game algorithm for generalized iterated function systems
• The chaos game on a general iterated function system
• "Chaos Games" for Iterated Function Systems with Grey Level Maps
• Ergodic theorem for infinite iterated function systems

Cited in

(5)

• Sieving random iterative function systems
• Some stochastic properties of topological dynamics of semigroup actions
• Random iteration for infinite nonexpansive iterated function systems
• Non-hyperbolic iterated function systems: semifractals and the chaos game
• Sporadicity: Between periodic and chaotic dynamical behaviors

This page was built for publication: Random iteration for non-expansive iterated function systems: derandomised algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q258020)