Work

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

Year: 2025
Type: article
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.
Author: Tomasz Martyn
Language: English
Open Access status: gold
Estimated APC paid: $115
OpenAlex ID: W4409210570
FWCI:
Cites:
Cited by:
Related to: 10