Novel method of fractal approximation

@article{Igudesman2012NovelMO,
  title={Novel method of fractal approximation},
  author={K. Igudesman and G. Shabernev},
  journal={Lobachevskii Journal of Mathematics},
  year={2012},
  volume={34},
  pages={125-132}
}
We introduce new method of optimization for finding free parameters of affine iterated function systems (IFS), which are used for fractal approximation. We provide the comparison of effectiveness of fractal and quadratic types of approximation, which are based on a similar optimization scheme, on the various types of data: polynomial function, DNA primary sequence, price graph and graph of random walking. 

Figures from this paper

Novel Approach to Calculation of Box Dimension of Fractal Functions
We introduce new method of calculation of box dimension of fractal functions’ graphs, which are based on fractal interpolation functions. Provide a comparison of the eectiveness of the traditionalExpand
New Approach to Fractal Approximation of Vector-Functions
This paper introduces new approach to approximation of continuous vector-functions and vector sequences by fractal interpolation vector-functions which are multidimensional generalization of fractalExpand
Explicitly defined fractal interpolation functions with variable parameters
Abstract We construct an explicit formula for the fractal interpolation function associated to an IFS with variable parameters. The solution is given in terms of the base p representation of numbers.Expand
Fractal approximation of vector functions
We present a new approach to the approximation of continuous vector-valued functions by fractal interpolative vector-valued ones and find optimal values of their parameters. We illustrate theExpand
Bilinear fractal interpolation and box dimension
TLDR
In the context of general iterated function systems (IFSs), bilinear fractal interpolants are introduced as the fixed points of certain Read-Bajraktarevic operators by exhibiting a generalized "taxi-cab" metric and presenting an explicit formula for the box-counting dimension of the graph of a bilin EAR interpolant in the case of equally spaced data points. Expand
Self-Similar Models and How to Find Them: A Moment Theory Approach
Self-similar modelling aims to capture how an object relates to itself, and can be done through fractal geometry. Creating a fractal that looks like a natural object is easy, finding a fractal thatExpand

References

SHOWING 1-8 OF 8 REFERENCES
Fractals everywhere
Focusing on how fractal geometry can be used to model real objects in the physical world, this up-to-date edition featurestwo 16-page full-color inserts, problems and tools emphasizing fractalExpand
Differentiability of fractal curves
A self-similar set that spans can have no tangent hyperplane at any single point. There are lots of smooth self-affine curves, however. We consider plane self-affine curves without double points andExpand
Fractal image compression
TLDR
Data compression with fractals is an approach to reach high compression ratios for large data streams related to images, at a cost of large amounts of computation. Expand
Fractal landscapes in biological systems: long-range correlations in DNA and interbeat heart intervals.
TLDR
It is found that under normal conditions, beat-to-beat fluctuations in heart rate display long-range power law correlations, consistent with the intron-late hypothesis of gene evolution. Expand
Interpolation and Approximation with Splines and Fractals
This textbook is intended to supplement the classical theory of uni- and multivariate splines and their approximation and interpolation properties with those of fractals, fractal functions, andExpand
A representation of DNA primary sequences by random walk.
TLDR
It is proved that two random sequences {Y(m)} and {X(n)} are both Markov chains, and some new invariants for the DNA primary sequences are introduced. Expand
Fractals and self similarity
  • Indiana Univ. Math. J.,
  • 1981
Fractals and self similarity
  • Indiana Univ . Math . J .