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

• Autorzy: Martyn Tomasz

Identyfikatory

DOI

10.24425/ijet.2025.153539

• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

IFS; Discrete Space; Markov Chain; Approximation; Invariant Set; Invariant Measure

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2025
• Tom: Vol. 71, No. 1
• Strony: 19--24
• Opis fizyczny: Bibliogr. 3 poz., rys.

Twórcy

autor

Martyn Tomasz

• Warsaw University of Technology

Bibliografia

• [1] T. Martyn, ”A computer scientist’s perspective on approximation of IFS invariant sets and measures with the random iteration algorithm”, International Journal of Electronics and Telecommunications, vol. 70, no. 4, pp. 1113-1123, 2024. https://doi.org/10.24425/ijet.2024.152514
• [2] M. Peruggia, Discrete Iterated Function Systems. A. K. Peters Wellesley MA, 1993. https://doi.org/10.5402/2012/825782
• [3] O. S. Lawlor OS, GPU-accelerated rendering of unbounded nonlinear iterated function system fixed points, ISRN Computer Graphics, vol. 2012:1–17, 2012.

Uwagi

Opracowanie rekordu ze środków MNiSW, umowa nr POPUL/SP/0154/2024/02 w ramach programu "Społeczna odpowiedzialność nauki II" - moduł: Popularyzacja nauki (2025).