1995
DOI: 10.1090/s0273-0979-1995-00558-6
|View full text |Cite
|
Sign up to set email alerts
|

Chaos in the Lorenz equations: a computer-assisted proof

Abstract: Abstract.A new technique for obtaining rigorous results concerning the global dynamics of nonlinear systems is described. The technique combines abstract existence results based on the Conley index theory with computer-assisted computations. As an application of these methods it is proven that for an explicit parameter value the Lorenz equations exhibit chaotic dynamics. IntroductionThe purpose of this note is to briefly describe a new technique for obtaining rigorous results concerning the global dynamics of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
140
0
3

Year Published

1996
1996
2016
2016

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 209 publications
(143 citation statements)
references
References 7 publications
0
140
0
3
Order By: Relevance
“…Oddly enough, the original equations introduced by Lorenz have remained a puzzle. A few computer-assisted proofs, however, have quite recently been announced, see [3], [6], [12]. These papers deal with subsets of A which are not attracting, and therefore only concern a set of trajectories having measure zero.…”
Section: Background To the Problemmentioning
confidence: 99%
“…Oddly enough, the original equations introduced by Lorenz have remained a puzzle. A few computer-assisted proofs, however, have quite recently been announced, see [3], [6], [12]. These papers deal with subsets of A which are not attracting, and therefore only concern a set of trajectories having measure zero.…”
Section: Background To the Problemmentioning
confidence: 99%
“…Thus the above is indeed the solution of system (9). The next step is to show the uniqueness of the solution.…”
Section: Theoremmentioning
confidence: 84%
“…The next step is to show the uniqueness of the solution. Let assume that we can find a different function F 1 ptq satisfying system (9). Then:…”
Section: Theoremmentioning
confidence: 99%
See 1 more Smart Citation
“…M. Eidenschink and Mischaikow [3] are currently developing numerical algorithms for computing connection matrices for systems of ordinary differential equations. This, combined with the work of M. Mrozek and Mischaikow [22,23], provides a technique for rigorously determining the connection matrices for fixed choices of θ. In the language of travelling waves, the connections found via the connection matrix correspond most closely to Fischer waves.…”
Section: Let η Denote the Number Of Negative Eigenvalues Ofmentioning
confidence: 99%