A computer scientist’s perspective on approximation of IFS invariant sets and measures with the random iteration algorithm

Autor:	Tomasz Martyn
Jazyk:	angličtina
Rok vydání:	2024
Předmět:	ifs discrete space markov chain approximation invariant set invariant measure Electrical engineering. Electronics. Nuclear engineering TK1-9971 Telecommunication TK5101-6720
Zdroj:	International Journal of Electronics and Telecommunications, Vol vol. 70, Iss No 4 (2024)
Druh dokumentu:	article
ISSN:	2081-8491 2300-1933
DOI:	10.24425/ijet.2024.152514
Popis:	We study invariant sets and measures generated by iterated function systems defined on countable discrete spaces that are uniform grids of a finite dimension. The discrete spaces of this type can be considered as models of spaces in which actual numerical computation takes place. In this context, we investigate the possibility of the application of the random iteration algorithm to approximate these discrete IFS invariant sets and measures. The problems concerning a discretization of hyperbolic IFSs are considered as special cases of this more general setting.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/78936b802e294b91a8cb2abbd5beaee9 Zobrazit plný text záznamu View record in DOAJ