Related papers: Graph-Directed Fractal Interpolation Functions
In this paper, we observe graph fractaloids, which are the graph groupoids with fractal property. In particular, we classify them in terms of the spectral data of certain Hilbert space operators, called the radial operators. Based on these…
In this work we propose a definition of an Euroattractor: an attracting invariant measure of a certain iterated functions system (IFS). An IFS is defined by specifying a set of functions, defined in subsets of R^N or in a classical phase…
In this paper we study the consequences of overinterpolation, i.e., the situation when a function can be interpolated by polynomial, or rational, or algebraic functions in more points that normally expected. We show that in many cases such…
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…
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…
In this paper we compute the Fourier spectrum of the Fractal Interpolation Functions FIFs as introduced by Michael Barnsley. We show that there is an analytical way to compute them. In this paper we attempt to solve the inverse problem of…
This article presents a reformulation of the Theory of Functional Connections: a general methodology for functional interpolation that can embed a set of user-specified linear constraints. The reformulation presented in this paper exploits…
Local iterated function systems are an important generalisation of the standard (global) iterated function systems (IFSs). For a particular class of mappings, their fixed points are the graphs of local fractal functions and these functions…
This paper provides an alternative description for the fixed points of the fractal operator associated with a mixed possibly infinite iterated function system via a canonical projection type function. Some visual aspects of our results are…
We investigate the topological and metric properties of attractors of an iterated function system (IFS) whose functions may not be contractive. We focus, in particular, on invertible IFSs of finitely many maps on a compact metric space. We…
This article deals with (1) the construction of a general non-linear fractal interpolation function on PCF self-similar sets, (2) the energy and normal derivatives of uniform non-linear fractal functions, (3) estimation of the bound of box…
We introduce a new arc in directed graphs of integers. Among other things, we determine the positive integers that have arcs to all except a finite number of positive integers. We also propose some possible research problems at the end of…
A method for data-driven interpolatory model reduction is presented in this extended abstract. This framework enables the computation of the transfer function values at given interpolation points based on time-domain input-output data only,…
We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic…
We construct a wavelet and a generalised Fourier basis with respect to some fractal measures given by one-dimensional iterated function systems. In this paper we will not assume that these systems are given by linear contractions…
This paper addresses the problem of approximating a function of bounded variation from its scattered data. Radial basis function(RBF) interpolation methods are known to approximate only functions in their native spaces, and to date, there…
We develop the theory of fractal homeomorphisms generated from pairs of overlapping affine iterated function systems.
A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…
Basic operations in graph signal processing consist in processing signals indexed on graphs either by filtering them, to extract specific part out of them, or by changing their domain of representation, using some transformation or…
For fixed natural numbers $r$ and $s$, where $2\leq s \leq r$, we consider a representation of numbers from the interval $[0;\frac{r}{s-1}]$ obtained by encoding numbers by means of the alphabet $A=\{0,1,...,r\}$ via the expansion…