The chaos game on a general iterated function system

Simple item page
dc.contributor.authorBarnsley, Michael
dc.contributor.authorvince, Andrew
dc.date.accessioned2015-12-10T23:11:53Z
dc.date.issued2011
dc.date.updated2015-12-10T09:24:54Z
dc.description.abstractThe main theorem of this paper establishes conditions under which the 'chaos game' algorithm almost surely yields the attractor of an iterated function system. The theorem holds in a very general setting, even for non-contractive iterated function systems, and under weaker conditions on the random orbit of the chaos game than obtained previously.
dc.identifier.issn0143-3857
dc.identifier.urihttp://hdl.handle.net/1885/63880
dc.publisherCambridge University Press
dc.sourceErgodic Theory and Dynamical Systems
dc.titleThe chaos game on a general iterated function system
dc.typeJournal article
local.bibliographicCitation.issue4
local.bibliographicCitation.lastpage1079
local.bibliographicCitation.startpage1073
local.contributor.affiliationBarnsley, Michael, College of Physical and Mathematical Sciences, ANU
local.contributor.affiliationvince, Andrew, University of Florida
local.contributor.authoruidBarnsley, Michael, u4138881
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.identifier.absfor010203 - Calculus of Variations, Systems Theory and Control Theory
local.identifier.absfor080201 - Analysis of Algorithms and Complexity
local.identifier.ariespublicationf2965xPUB859
local.identifier.citationvolume31
local.identifier.doi10.1017/S0143385710000428
local.identifier.scopusID2-s2.0-80053050396
local.identifier.thomsonID000293443400004
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Barnsley_The_chaos_game_on_a_general_2011.pdf
Size:
121.84 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS