Date Thesis Awarded


Access Type

Honors Thesis -- Access Restricted On-Campus Only

Degree Name

Bachelors of Science (BS)




Sarah Day

Committee Members

D. J. Lutzer

Robert Michael Lewis

John Delos


This paper explores different analytical and computational methods of computing the box-counting dimension of a fractal-like set, such as the attractor associated with a chaotic dynamical system. Because attractors cannot be described exactly, but can only be approximated by computational methods, the box-counting dimension is typically measured computationally. Using alternative measures of chaotic behavior, such as the Lyapunov exponents, it is possible to estimate the accuracy of a computational approximation. The box-counting dimension definition is extended to include subsets of regular subspaces of R?. These sets include products of Cantor sets and attractors associated with infinite dimensional dynamical systems, such as the Kot-Schaffer model. Computational approaches to computing the box-counting dimension of the Kot-Schaffer attractor are discussed and the results for this attractor are discussed.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.


Thesis is part of Honors ETD pilot project, 2008-2013. Migrated from Dspace in 2016.

On-Campus Access Only