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

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.

Institutions

Publication Details

Journal
International Journal of Electronics and Telecommunications
Published
2025-04-07
DOI
https://doi.org/10.24425/ijet.2025.153539
Primary Topic
Mathematical Approximation and Integration
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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
Mathematical Approximation and Integration
article

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

article en

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.

International Journal of Electronics and Telecommunications
Warsaw University of Technology (PL)
Openalex Percentile: Top 90%
Mathematical Approximation and Integration
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

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 (2025) | TGRS Research Map | TGRS