Making the computation of approximations of invariant measures and its attractors for IFS and GIFS, through the deterministic algorithm, tractable
From MaRDI portal
Publication:6380943
DOI10.1016/J.CHAOS.2022.112844arXiv2110.11142MaRDI QIDQ6380943FDOQ6380943
Authors: Rudnei D. da Cunha, Elismar R. Oliveira 
Publication date: 21 October 2021
Abstract: We present algorithms to compute approximations of invariant measures and its attractors for IFS and GIFS, using the deterministic algorithm in a tractable way, with code optimization strategies and use of data structures and search algorithms. The results show that these algorithms allow the use of these (G)IFS in a reasonable running time.
Fractals (28A80) Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.) (37M25) Graphical methods in numerical analysis (65S05)
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6380943)
