A fast algorithm to determine fractal dimensions by box counting
- 1 November 1989
- journal article
- Published by Elsevier in Physics Letters A
- Vol. 141 (8-9) , 386-390
- https://doi.org/10.1016/0375-9601(89)90854-2
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Singular-value decomposition and the Grassberger-Procaccia algorithmPhysical Review A, 1988
- Efficient algorithm for estimating the correlation dimension from a set of discrete pointsPhysical Review A, 1987
- Liapunov exponents from time seriesPhysical Review A, 1986
- An efficient procedure to compute fractal dimensions by box countingPhysics Letters A, 1986
- Determining Lyapunov exponents from a time seriesPhysica D: Nonlinear Phenomena, 1985
- On the fractal dimension of the Henon attractorPhysics Letters A, 1983
- Characterization of Strange AttractorsPhysical Review Letters, 1983
- Impracticality of a box-counting algorithm for calculating the dimensionality of strange attractorsPhysical Review A, 1982
- Dimension of Strange AttractorsPhysical Review Letters, 1980
- Geometry from a Time SeriesPhysical Review Letters, 1980