Chaos, attractors and the Lorenz conjecture: Noninvertible transitive maps of ivariant sets are sensitive.
2010-06
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Chaos, attractors and the Lorenz conjecture: Noninvertible transitive maps of ivariant sets are sensitive.
Authors
Published Date
2010-06
Publisher
Type
Thesis or Dissertation
Abstract
In 1989, Edward Lorenz published a paper entitled, “Computational chaos- a prelude to computational instability” [L]. His paper looked at Euler approximations to differential equations. If the time increment of the approximating function was increased, he found that computational chaos set in. Since the numerics suggested transitivity and noninvertibility, he conjectured that transitive, noninvertible maps of an attractor were chaotic. To set the stage for investigating this conjecture, this thesis looked to examine the relationships between some of the standard definitions of chaos and attractor used throughout the literature. In addition to offering a proof of the Lorenz conjecture, a review of a number of related results was conducted. A side product of the work done was a partial result that tried to address whether topological transitivity carries sensitivity at a point to sensitivity on a set.
Description
University of Minnesota M.S. dissertation. July 2010. Major: Mathematics. Advisor: Bruce B. Peckham. 1 computer file (PDF); iv, 36 pages, appendices A-C.
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Taft, Garrett Thomas. (2010). Chaos, attractors and the Lorenz conjecture: Noninvertible transitive maps of ivariant sets are sensitive.. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/96264.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.