Random iteration for non-expansive iterated function systems: derandomised algorithm (Q258020)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Random iteration for non-expansive iterated function systems: derandomised algorithm |
scientific article; zbMATH DE number 6557629
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random iteration for non-expansive iterated function systems: derandomised algorithm |
scientific article; zbMATH DE number 6557629 |
Statements
Random iteration for non-expansive iterated function systems: derandomised algorithm (English)
0 references
17 March 2016
0 references
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.
0 references
chaos game
0 references
strict attractor
0 references
non-expansive maps
0 references
disjunctive sequences
0 references
random iteration
0 references
derandomised algorithm
0 references
iterated function systems
0 references
0.8623800873756409
0 references
0.8579630255699158
0 references
0.828523576259613
0 references
0.8028222918510437
0 references
0.8028222918510437
0 references
