EXISTENCE AND BOX DIMENSION OF GENERAL RECURRENT FRACTAL INTERPOLATION FUNCTIONS

Author(s):  
HUO-JUN RUAN ◽  
JIAN-CI XIAO ◽  
BING YANG

Abstract The notion of recurrent fractal interpolation functions (RFIFs) was introduced by Barnsley et al. [‘Recurrent iterated function systems’, Constr. Approx.5 (1989), 362–378]. Roughly speaking, the graph of an RFIF is the invariant set of a recurrent iterated function system on $\mathbb {R}^2$ . We generalise the definition of RFIFs so that iterated functions in the recurrent system need not be contractive with respect to the first variable. We obtain the box dimensions of all self-affine RFIFs in this general setting.

2012 ◽  
Vol 22 (08) ◽  
pp. 1250194 ◽  
Author(s):  
HONG-YONG WANG ◽  
JIA-BING JI

The fitting of a given continuous surface defined on a rectangular region in ℝ2 is studied by using a fractal interpolation surface, and the error analysis of fitting is made in this paper. The fractal interpolation functions used in surface fitting are generated by a special class of iterated function systems. Some properties of such fractal interpolation functions are discussed. Moreover, the error problems of fitting are investigated by using an operator defined on the space of continuous functions, and the upper estimates of errors are obtained in the sense of two kinds of metrics. Finally, a specific numerical example to illustrate the application of the procedure is also described.


Fractals ◽  
2006 ◽  
Vol 14 (03) ◽  
pp. 223-230 ◽  
Author(s):  
HONG-YONG WANG

In this paper, we consider a wide class of iterated function systems in R3, and show that their attractors are a class of fractal interpolation surfaces. Based on a refinement equation, we investigate the properties of smoothness of the fractal interpolation functions, and give the results of the smoothness in several cases.


Fractals ◽  
2019 ◽  
Vol 27 (08) ◽  
pp. 1950141 ◽  
Author(s):  
S. K. KATIYAR ◽  
A. K. B. CHAND

The appearance of fractal interpolation function represents a revival of experimental mathematics, raised by computers and intensified by powerful evidence of its applications. This paper is devoted to establish a method to construct [Formula: see text]-fractal rational quartic spline, which eventually provides a unified approach for the generalization of various traditional nonrecursive rational splines involving shape parameters. We deduce the uniform error bound for the [Formula: see text]-fractal rational quartic spline when the original function is in [Formula: see text]. By solving a system of linear equations, appropriate values of the derivative parameters are determined so as to enhance the continuity of the [Formula: see text]-fractal rational quartic spline to [Formula: see text]. The elements of the iterated function system are identified befittingly so that the class of [Formula: see text]-fractal function [Formula: see text] incorporates the geometric features such as positivity, monotonicity and convexity in addition to the regularity inherent in the germ [Formula: see text]. This general theory in conjunction with shape preserving aspects of the traditional splines provides algorithms for the construction of shape preserving fractal interpolation functions.


Fractals ◽  
2009 ◽  
Vol 17 (02) ◽  
pp. 161-170
Author(s):  
HONG-YONG WANG

The sensitivity analysis for a class of hidden variable fractal interpolation functions (HVFIFs) and their moments is made in the work. Based on a vector valued iterated function system (IFS) determined, we introduce a perturbed IFS and investigate the relations between the two HVFIFs generated by the IFS determined and its perturbed IFS, respectively. An explicit expression for the difference between the two HVFIFs is presented, from which, we show that the HVFIFs are not sensitive to a small perturbation in IFSs. Furthermore, we compute the moment integrals of the HVFIFs and discuss the error of moments of the two HVFIFs. An upper estimate for the error is obtained.


2021 ◽  
Vol 5 (2) ◽  
pp. 28
Author(s):  
Song-Il Ri ◽  
Vasileios Drakopoulos ◽  
Song-Min Nam

The Koch curve was first described by the Swedish mathematician Helge von Koch in 1904 as an example of a continuous but nowhere differentiable curve. Such functions are now characterised as fractal since their graphs are in general fractal sets. Furthermore, it can be obtained as the graph of an appropriately chosen iterated function system. On the other hand, a fractal interpolation function can be seen as a special case of an iterated function system thus maintaining all of its characteristics. Fractal interpolation functions are continuous functions that can be used to model continuous signals. An in-depth discussion on the theory of affine fractal interpolation functions generating the Koch Curve by using fractal analysis as well as its recent development including some of the research made by the authors is provided. We ensure that the graph of fractal interpolation functions on the Koch Curve are attractors of an iterated function system constructed by non-constant harmonic functions.


2019 ◽  
Vol 12 (02) ◽  
pp. 1950021 ◽  
Author(s):  
Chol-Hui Yun ◽  
Mi-Kyong Ri

In this paper, we present a construction of hidden variable bivariate fractal interpolation functions (HVBFIFs) with function vertical scaling factors and estimate errors of HVBFIFs on perturbation of the function vertical scaling factor. We construct HVBFIFs on the basis of the iterated function system (IFS) with function vertical scaling factors. The perturbation of the function vertical scaling factors in the IFS causes a change in the HVBFIF. An upper estimation of the errors between the original HVBFIF and the perturbed HVBFIF is given.


Axioms ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 119
Author(s):  
Nallapu Vijender ◽  
Vasileios Drakopoulos

In this article, firstly, an overview of affine fractal interpolation functions using a suitable iterated function system is presented and, secondly, the construction of Bernstein affine fractal interpolation functions in two and three dimensions is introduced. Moreover, the convergence of the proposed Bernstein affine fractal interpolation functions towards the data generating function does not require any condition on the scaling factors. Consequently, the proposed Bernstein affine fractal interpolation functions possess irregularity at any stage of convergence towards the data generating function.


2007 ◽  
Vol 18 (4) ◽  
pp. 449-476 ◽  
Author(s):  
P. BOUBOULIS ◽  
L. DALLA

We generalise the notion of fractal interpolation functions (FIFs) to allow data sets of the form where I=[0,1]n. We introduce recurrent iterated function systems whose attractors G are graphs of continuous functions f:I→, which interpolate the data. We show that the proposed constructions generalise the previously existed ones on . We also present some relations between FIFs and the Laplace partial differential equation with Dirichlet boundary conditions. Finally, the fractal dimensions of a class of FIFs are derived and some methods for the construction of functions of class Cp using recurrent iterated function systems are presented.


Sign in / Sign up

Export Citation Format

Share Document