A computer scientist’s perspective on approximation of IFS invariant sets and measures with the random iteration algorithm
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...
Saved in:
| Main Author: | Tomasz Martyn |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Academy of Sciences
2024-11-01
|
| Series: | International Journal of Electronics and Telecommunications |
| Subjects: | |
| Online Access: | https://journals.pan.pl/Content/133241/PDF/41_4838_Martyn_L_sk.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Digital Video Compression Using DCT-Based Iterated Function System (IFS)
by: Nevart A. Minas, et al.
Published: (2023-01-01) -
Scale-Invariant Feature Transform Algorithm with Fast Approximate Nearest Neighbor
by: Baghdad Science Journal
Published: (2017-09-01) -
Scale-Invariant Feature Transform Algorithm with Fast Approximate Nearest Neighbor
by: Ekhlas Khalaf Gbash, et al.
Published: (2017-09-01) -
Robust Positively Invariant Conditions for Perturbed Linear Discrete-Time Systems Using Dual Optimization
by: Hongli Yang, et al.
Published: (2025-02-01) -
Extension of Dasgupta’s Technique for Higher Degree Approximation
by: P. L. Powar, et al.
Published: (2021-06-01)