A computer scientist's perspective on approximation of IFS invariant sets and measures with the random iteration algorithm---Proofs and Examples

Authors

  • Tomasz Martyn Warsaaw University of Technology

Abstract

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.

Additional Files

Published

2025-03-26

Issue

Section

Applied Informatics