Date of Award
2006
Document Type
Dissertation
Publication Status
Version of Record
Submission Date
October 2026
Thesis/Dissertation Advisor [Chair]
Kalies, William D.
Abstract
In this dissertation we present a computational approach to Conley's Decomposition Theorem, which gives a global decomposition of dynamical systems, and introduce an explicit numerical algorithm with computational complexity bounds for computing global dynamical structures of a continous map including attractorrepeller pairs and Conley's Lyapunov function. The approach is based on finite spatial discretizations and combinatorial multivalued maps. The method is successful in exhibiting approximations of attractor-repeller pairs, invariant sets, and Conley's Lyapunov function. We used the C++ language to code the algorithm.
Extent
173 p.
Recommended Citation
Ban, Hyunju, "Computing Global Decompositions of Dynamical Systems" (2006). Electronic Theses and Dissertations 2000 - 2009. 1023.
https://digitalcommons.fau.edu/etd_general_5/1023
Identifier
FA00000848
Comments
Dissertation (Ph.D.)--Florida Atlantic University, 2006.|Dissertation (Ph.D.)--Florida Atlantic University, 2006.