A computer scientist’s perspective on approximation of IFS invariant sets and measures with the random iteration algorithm—proofs and examples
DOI:
https://doi.org/10.24425/ijet.2025.153539Abstract
We present proofs of the theorems and lemmas demonstrated previously in our paper [1]. We also display some visual examples of minimal absorbing sets and their basins of attractions generated by δ-roundoffs of two-dimensional linear contractions as well as visualizations of DIFS stationary probability measures.
Published
2025-04-07
How to Cite
Martyn, Tomasz. “A Computer scientist’s Perspective on Approximation of IFS Invariant Sets and Measures With the Random Iteration algorithm—proofs and Examples”. International Journal of Electronics and Telecommunications, vol. 71, no. 1, Apr. 2025, doi:10.24425/ijet.2025.153539.
Issue
Section
Artykuły