Abstract
The theory of chaotic dynamical systems can be a tricky area of study for a non-expert to break into. Because the theory is relatively recent, the new student finds himself immersed in a subject with very few clear and intuitive definitions. This paper aims to carve out a small section of the theory of chaotic dynamical systems – that of attractors – and outline its fundamental concepts from a computational mathematics perspective. The motivation for this paper is primarily to define what an attractor is and to clarify what distinguishes its various types (nonstrange, strange nonchaotic, and strange chaotic). Furthermore, by providing some examples of attractors and explaining how and why they are classified, we hope to provide the reader with a good feel for the fundamental connection between fractal geometry and the existence of chaos.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
