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

Authors: Krzysztof Leśniak

Addresses: Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, ul. Chopina 12/18, 87-100 Toruń, Poland

Abstract: 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.

Keywords: chaos game; strict attractor; non-expansive maps; disjunctive sequences; random iteration; derandomised algorithm; iterated function systems.

DOI: 10.1504/IJANS.2014.068267

International Journal of Applied Nonlinear Science, 2014 Vol.1 No.4, pp.360 - 363

Received: 02 Jul 2014
Accepted: 03 Nov 2014
Published online: 08 Apr 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article