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

Authors

  • Tomasz Martyn Faculty of Electronics and Information Theory, Warsaw University of Technology, Poland

DOI:

https://doi.org/10.24425/ijet.2024.152514

Abstract

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.

Published

2024-11-25

How to Cite

Martyn, Tomasz. “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, Nov. 2024, doi:10.24425/ijet.2024.152514.

Issue

Section

Artykuły