Accuracy analysis of the box-counting algorithm

Details Accuracy analysis of the box-counting algorithm Accuracy analysis of the box-counting algorithm

2011-11-24

arxiv.org/abs/1111.5749v1

Nonlinear Sciences

Adaptation and Self-Organizing Systems

3 figures

Scientific paper

Accuracy of the box-counting algorithm for numerical computation of the fractal exponents is investigated. To this end several sample mathematical fractal sets are analyzed. It is shown that the standard deviation obtained for the fit of the fractal scaling in the log-log plot strongly underestimates the actual error. The real computational error was found to have power scaling with respect to the number of data points in the sample ($n_{tot}$). For fractals embedded in two-dimensional space the error is larger than for those embedded in one-dimensional space. For fractal functions the error is even larger. Obtained formula can give more realistic estimates for the computed generalized fractal exponents' accuracy.

Affiliated with

Also associated with

No associations

Rating

Accuracy analysis of the box-counting algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Accuracy analysis of the box-counting algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Accuracy analysis of the box-counting algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-157236