Online abstract and download information
We propose an efficent iterative scheme for calculating the box-counting (capacity) dimension of a chaotic attractor in terms of its average expansion rates. Similar to the Kaplan-Yorke conjecture for the information dimension, this scheme provides a connection between a geometric property of a strange set and its underlying dynamical properties. Our conjecture is demonstrated analytically with an exactly solvable two dimensional hyperbolic map and numerically with a more complicated higher dimensional non-hyperbolic map.
Back to my list of recent papers.
Back to my home page.Updated: June 17, 1999