A fast algorithm to determine fractal dimensions by box counting

[1]  William H. Press,et al.  Numerical recipes , 1990 .

[2]  Schwartz,et al.  Singular-value decomposition and the Grassberger-Procaccia algorithm. , 1988, Physical review. A, General physics.

[3]  Michael F. Barnsley,et al.  Fractals everywhere , 1988 .

[4]  Theiler,et al.  Efficient algorithm for estimating the correlation dimension from a set of discrete points. , 1987, Physical review. A, General physics.

[5]  Eckmann,et al.  Liapunov exponents from time series. , 1986, Physical review. A, General physics.

[6]  Antonio Giorgilli,et al.  An efficient procedure to compute fractal dimensions by box counting , 1986 .

[7]  A. Wolf,et al.  Determining Lyapunov exponents from a time series , 1985 .

[8]  P. Grassberger,et al.  Measuring the Strangeness of Strange Attractors , 1983 .

[9]  Peter Grassberger,et al.  On the fractal dimension of the Henon attractor , 1983 .

[10]  H. G. E. Hentschel,et al.  The infinite number of generalized dimensions of fractals and strange attractors , 1983 .

[11]  P. Grassberger,et al.  Characterization of Strange Attractors , 1983 .

[12]  A. Wolf,et al.  Impracticality of a box-counting algorithm for calculating the dimensionality of strange attractors , 1982 .

[13]  F. Takens.  Detecting strange attractors in turbulence , 1981 .

[14]  E. Ott,et al.  Dimension of Strange Attractors , 1980 .

[15]  James P. Crutchfield,et al.  Geometry from a Time Series , 1980 .

[16]  Benoit B. Mandelbrot,et al.  Fractal Geometry of Nature , 1984 .