Random iteration for non-expansive iterated function systems: derandomised algorithm
by Krzysztof Leśniak
International Journal of Applied Nonlinear Science (IJANS), Vol. 1, No. 4, 2014

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.

Online publication date: Wed, 25-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Nonlinear Science (IJANS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com