fractal approximation
Recently Published Documents


TOTAL DOCUMENTS

36
(FIVE YEARS 6)

H-INDEX

7
(FIVE YEARS 1)

2020 ◽  
Vol 12 (8) ◽  
pp. 1038-1043
Author(s):  
Wadia Faid Hassan Al-Shameri

Barnsley (Barnsley, M.F., 1986. Fractal functions and interpolation. Constr. Approx., 2, pp.303–329) introduced fractal interpolation function (FIF) whose graph is the attractor of an iterated function system (IFS) for describing the data that have an irregular or self-similar structure. Barnsley et al. (Barnsley, M.F., et al., 1989. Recurrent iterated function systems in fractal approximation. Constr. Approx., 5, pp.3–31) generalized FIF in the form of recurrent fractal interpolation function (RFIF) whose graph is the attractor of a recurrent iterated function system (RIFS) to fit data set which is piece-wise self-affine. The primary aim of the present research is investigating the RFIF approach and using it for fitting the piece-wise self-affine data set in ℜ2.


Author(s):  
N. Vijender ◽  
A. K. B. Chand ◽  
M. A. Navascués ◽  
M. V. Sebastián

Fractals ◽  
2018 ◽  
Vol 26 (05) ◽  
pp. 1850079 ◽  
Author(s):  
M. A. NAVASCUÉS ◽  
SANGITA JHA ◽  
A. K. B. CHAND ◽  
M. V. SEBASTIÁN

The reconstruction of an unknown function providing a set of Lagrange data can be approached by means of fractal interpolation. The power of that methodology allows us to generalize any other interpolant, both smooth and nonsmooth, but the important fact is that this technique provides one of the few methods of nondifferentiable interpolation. In this way, it constitutes a functional model for chaotic processes. This paper studies a generalization of an approximation formula proposed by Dunham Jackson, where a wider range of values of an exponent of the basic trigonometric functions is considered. The trigonometric polynomials are then transformed in close fractal functions that, in general, are not smooth. For suitable election of this parameter, one obtains better conditions of convergence than in the classical case: the hypothesis of continuity alone is enough to ensure the convergence when the sampling frequency is increased. Finally, bounds of discrete fractal Jackson operators and their classical counterparts are proposed.


2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Konstantin Igudesman ◽  
Marsel Davletbaev ◽  
Gleb Shabernev

This paper introduces new approach to approximation of continuous vector-functions and vector sequences by fractal interpolation vector-functions which are multidimensional generalization of fractal interpolation functions. Best values of fractal interpolation vector-functions parameters are found. We give schemes of approximation of some sets of data and consider examples of approximation of smooth curves with different conditions.


2013 ◽  
Vol 1 (2) ◽  
pp. 193-203
Author(s):  
Rodel Azura ◽  
◽  
Dennis Tarepe ◽  
Mark Borres ◽  
Jocelyn Panduyos ◽  
...  

2013 ◽  
Vol 57 (11) ◽  
pp. 61-64
Author(s):  
M. F. Davletbaev ◽  
K. B. Igudesman

Sign in / Sign up

Export Citation Format

Share Document