Related papers: Blending attractors of Iterated Function Systems
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…
We consider iterated function systems on the real line that consist of continuous, piecewise linear functions. Under a mild separation condition, we show that the Hausdorff and box dimensions of the attractor are equal to the minimum of 1…
This article aims to study fractal interpolation functions corresponding to a sequence of iterated function systems (IFSs). For a suitable choice of a sequence of IFS parameters, the corresponding non-stationary fractal function is a better…
Fractal interpolation function (FIF) is a special type of continuous function which interpolates certain data set and the attractor of the Iterated function system (IFS) corresponding to the data set is the graph of the FIF. Coalescence…
A fractal surface is a set which is a graph of a bivariate continuous function. In the construction of fractal surfaces using IFS, vertical scaling factors in IFS are important one which characterizes a fractal feature of surfaces…
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…
This paper presents a new approach of constructing $\alpha$-fractal interpolation functions (FIFs) using neural network operators, integrating concepts from approximation theory. Initially, we construct $\alpha$-fractals utilizing neural…
Consider two objects associated to the Iterated Function System (IFS) $\{1+\lambda z,-1+\lambda z\}$: the locus $\mathcal{M}$ of parameters $\lambda\in\mathbb{D}\setminus\{0\}$ for which the corresponding attractor is connected; and the…
In this paper we combine two existing approaches for approximating attractors. One of them approximates the attractors arbitrarily well by sublevel sets related to solutions of infinite dimensional linear programming problems. A downside…
We present an Expectation-Maximization algorithm for the fractal inverse problem: the problem of fitting a fractal model to data. In our setting the fractals are Iterated Function Systems (IFS), with similitudes as the family of…
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.…
For directed graph iterated function systems (IFSs) defined on R, we prove that a class of 2-vertex directed graph IFSs have attractors that cannot be the attractors of standard (1-vertex directed graph) IFSs, with or without separation…
We formulate the blended force-based quasicontinuum (BQCF) method for multilattices and develop rigorous error estimates in terms of the approximation parameters: atomistic region, blending region and continuum finite element mesh.…
Neural network models have recently demonstrated impressive prediction performance in complex systems where chaos and unpredictability appear. In spite of the research efforts carried out on predicting future trajectories or improving their…
Effective feature fusion of multispectral images plays a crucial role in multi-spectral object detection. Previous studies have demonstrated the effectiveness of feature fusion using convolutional neural networks, but these methods are…
We consider iterated functions systems (IFS) on compact metric spaces and introduce the concept of target sets. Such sets have very rich dynamical properties and play a similar role as semifractals introduced by Lasota and Myjak do for…
In this paper we propose a new efficient interpolation tool, extremely suitable for large scattered data sets. The partition of unity method is used and performed by blending Radial Basis Functions (RBFs) as local approximants and using…
Fractal geometry, defined by self-similar patterns across scales, is crucial for understanding natural structures. This work addresses the fractal inverse problem, which involves extracting fractal codes from images to explain these…
We recast the notion of parablender introduced in [Berger2015] as a parametric IFS. This is done using the concept of open covering property and looking to parametric IFS as systems acting on jets.
In this paper, we apply the implicit Euler scheme to discretize the (random) Burgers-Huxley equation and prove the existence of a numerical attractor for the discrete Burgers-Huxley system. We establish upper semi-convergence of the…