Random iteration for infinite nonexpansive iterated function systems.
We prove that the random iteration algorithm works for strict attractors of infinite iterated function systems. The system is assumed to be compactly branching and nonexpansive. The orbit recovering an attractor is generated by a deterministic process and the algorithm is always convergent. We also formulate a version of the random iteration for uncountable equicontinuous systems.
Faculty of Mathematics and Computer Science, Nicolaus Copernicus University in Toruń, Toruń, Poland.
Krzysztof
K
Leśniak