Making the computation of approximations of invariant measures and its attractors for IFS and GIFS, through the deterministic algorithm, tractable

DOI10.1016/j.chaos.2022.112844OpenAlexW4308533316MaRDI QIDQ2679994

Rudnei D. da Cunha, Elismar R. Oliveira

Publication date: 26 January 2023

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.11142

zbMATH Keywords

attractorsfuzzy setsfractalsiterated function systemshierarchical data structuresalgorithms generating fractal images

Mathematics Subject Classification ID

Fractals (28A80) Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.) (37M25) Graphical methods in numerical analysis (65S05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms generating images of attractors of generalized iterated function systems
• Generalized iterated function systems with place dependent probabilities
• Applications of fixed point theorems in the theory of generalized IFS
• Generalized IFSs on noncompact spaces
• Invariant measures for Markov processes arising from iterated function systems with place-dependent probabilities
• Quad trees: A data structure for retrieval by composite keys
• Invariant measures of Markov operators associated to iterated function systems consisting of \(\varphi\)-max-contractions with probabilities
• A new algorithm that generates the image of the attractor of a generalized iterated function system
• A multiresolution algorithm to approximate the Hutchinson measure for IFS and GIFS
• A multiresolution algorithm to generate images of generalized fuzzy fractal attractors
• An Elementary Approach to Rigorous Approximation of Invariant Measures
• Rigorous approximation of stationary measures and convergence to equilibrium for iterated function systems
• Spaces and maps of idempotent measures
• Invariant idempotent measures

This page was built for publication: Making the computation of approximations of invariant measures and its attractors for IFS and GIFS, through the deterministic algorithm, tractable