相关论文: Euroattractor: a brief introduction to Iterated Fu…
If $F$ and $G$ are iterated function systems, then any infinite word $W$ in the symbols $F$ and $G$ induces a limit set. It is natural to ask whether this Cantor set can also be realized as the limit set of a single $C^{1 + \alpha}$…
Fluctuations in the return time statistics of a dynamical system can be described by a new spectrum of dimensions. Comparison with the usual multifractal analysis of measures is presented, and difference between the two corresponding sets…
We study new relations between countable iterated function systems (IFS) with overlaps, Smale endomorphisms and random systems with complete connections. We prove that stationary measures for countable conformal IFS with overlaps and…
We investigate the set of invariant idempotent probabilities for countable idempotent iterated function systems (IFS) defined in compact metric spaces. We demonstrate that, with constant weights, there exists a unique invariant idempotent…
This preliminary paper presents initial explorations in rendering Iterated Function System (IFS) fractals using a differentiable rendering pipeline. Differentiable rendering is a recent innovation at the intersection of computer graphics…
We study probabilistic iterated function systems (IFS), consisting of a finite or infinite number of average-contracting bi-Lipschitz maps on R^d. If our strong open set condition is also satisfied, we show that both upper and lower bounds…
In this paper, we reformulate the definition of the iterated function systems (denoted by general IFSs in this paper) and show the existence and uniqueness (in some sense) of the limit sets generated by the general IFSs, to unify the…
Consider a compact metric space $X$, and let $\mathcal{F}=\{f_1,\,f_2,\ldots,\, f_k\}$ be a set of contracting and continuous self maps on $X$. Let $\Sigma$ be a sub-shift on $k$ symbols, and let $\Sigma_k$ be the full shift. Define…
In this paper, we introduce the concept of the $\alpha$-fractal function and fractal approximation for a set-valued continuous map defined on a closed and bounded interval of real numbers. Also, we study some properties of such fractal…
We aim to construct a class of learning algorithms that are of practical value to applied researchers in fields such as biostatistics, epidemiology and econometrics, where the need to learn from incompletely observed information is…
This article discusses the notion of convergence of sequences of iterated function systems. The technique of iterated function systems is one of the several methods to construct objects with fractal nature, and the fractals obtained with…
In the present work, the notion of Super Fractal Interpolation Function (SFIF) is introduced for finer simulation of the objects of the nature or outcomes of scientific experiments that reveal one or more structures embedded in to another.…
We consider a construction of recurrent fractal interpolation surfaces with function vertical scaling factors and estimation of their box-counting dimension. A recurrent fractal interpolation surface (RFIS) is an attractor of a recurrent…
In this study we provide several significant generalisations of Banach contraction principle where the Lipschitz constant is substituted by real-valued control function that is a comparison function. We study non-stationary variants of…
We present algorithms to compute approximations of invariant measures and its attractors for IFS and GIFS, using the deterministic algorithm in a tractable way, with code optimization strategies and use of data structures and search…
For some fractal measures it is a very difficult problem in general to prove the existence of spectrum (respectively, frame, Riesz and Bessel spectrum). In fact there are examples of extremely sparse sets that are not even Bessel spectra.…
We consider the limit set of generalised iterated function systems. Under the assumption of a natural potential, the so called cylinder function, we prove the existence of the invariant probability measure satisfying the equilibrium state.…
This is the first article in a two-part series containing some results on dimension estimates for $C^1$ iterated function systems and repellers. In this part, we prove that the upper box-counting dimension of the attractor of any $C^1$…
In this paper we discuss a new method to blend fractal attractors using the code map for the IFS formed by the Hutchinson--Barnsley operators of a finite family of hyperbolic IFSs. We introduce a parameter called blending coefficient to…
Fractal interpolation functions (FIFs) generated using iterated function systems (IFS) provide a powerful framework for modeling self-similar and irregular data, yet traditional constructions often neglect geometric fidelity such as…