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

From MaRDI portal





Summary: A probabilistic algorithm, referred to as the `chaos game', is derandomised with the aid of deterministic symbolic sequences, known in the algorithmic complexity under the name `disjunctive words'. The deterministic algorithm is shown to work for attractors of iterated function systems comprising maps which do not increase distances.











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)