Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Simplified version  





2 Choice of delay  





3 See also  





4 References  





5 Further reading  





6 External links  














Takens's theorem







Add links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


Rössler attractor reconstructed by Taken's theorem, using different delay lengths. Orbits around the attractor have a period between 5.2 and 6.2.

In the study of dynamical systems, a delay embedding theorem gives the conditions under which a chaotic dynamical system can be reconstructed from a sequence of observations of the state of that system. The reconstruction preserves the properties of the dynamical system that do not change under smooth coordinate changes (i.e., diffeomorphisms), but it does not preserve the geometric shape of structures in phase space.

Takens' theorem is the 1981 delay embedding theorem of Floris Takens. It provides the conditions under which a smooth attractor can be reconstructed from the observations made with a generic function. Later results replaced the smooth attractor with a set of arbitrary box counting dimension and the class of generic functions with other classes of functions.

It is the most commonly used method for attractor reconstruction.[1]

Delay embedding theorems are simpler to state for discrete-time dynamical systems. The state space of the dynamical system is a ν-dimensional manifold M. The dynamics is given by a smooth map

Assume that the dynamics f has a strange attractor with box counting dimension dA. Using ideas from Whitney's embedding theorem, A can be embedded in k-dimensional Euclidean space with

That is, there is a diffeomorphism φ that maps A into such that the derivativeofφ has full rank.

A delay embedding theorem uses an observation function to construct the embedding function. An observation function must be twice-differentiable and associate a real number to any point of the attractor A. It must also be typical, so its derivative is of full rank and has no special symmetries in its components. The delay embedding theorem states that the function

is an embedding of the strange attractor Ain

Simplified version[edit]

Suppose the -dimensional state vector evolves according to an unknown but continuous and (crucially) deterministic dynamic. Suppose, too, that the one-dimensional observable is a smooth function of , and “coupled” to all the components of . Now at any time we can look not just at the present measurement , but also at observations made at times removed from us by multiples of some lag , etc. If we use lags, we have a -dimensional vector. One might expect that, as the number of lags is increased, the motion in the lagged space will become more and more predictable, and perhaps in the limit would become deterministic. In fact, the dynamics of the lagged vectors become deterministic at a finite dimension; not only that, but the deterministic dynamics are completely equivalent to those of the original state space (precisely, they are related by a smooth, invertible change of coordinates, or diffeomorphism). In fact, the theorem says that determinism appears once you reach dimension , and the minimal embedding dimension is often less.[2][3]

Choice of delay[edit]

Takens' theorem is usually used to reconstruct strange attractors out of experimental data, for which there is contamination by noise. As such, the choice of delay time becomes important. Whereas for data without noise, any choice of delay is valid, for noisy data, the attractor would be destroyed by noise for delays chosen badly.

The optimal delay is typically around one-tenth to one-half the mean orbital period around the attractor.[4][5]

See also[edit]

References[edit]

  1. ^ Sauer, Timothy D. (2006-10-24). "Attractor reconstruction". Scholarpedia. 1 (10): 1727. Bibcode:2006SchpJ...1.1727S. doi:10.4249/scholarpedia.1727. ISSN 1941-6016.
  • ^ Shalizi, Cosma R. (2006). "Methods and Techniques of Complex Systems Science: An Overview". In Deisboeck, ThomasS; Kresh, J.Yasha (eds.). Complex Systems Science in Biomedicine. Topics in Biomedical Engineering International Book Series. Springer US. pp. 33–114. arXiv:nlin/0307015. doi:10.1007/978-0-387-33532-2_2. ISBN 978-0-387-30241-6. S2CID 11972113.
  • ^ Barański, Krzysztof; Gutman, Yonatan; Śpiewak, Adam (2020-09-01). "A probabilistic Takens theorem". Nonlinearity. 33 (9): 4940–4966. arXiv:1811.05959. Bibcode:2020Nonli..33.4940B. doi:10.1088/1361-6544/ab8fb8. ISSN 0951-7715. S2CID 119137065.
  • ^ Strogatz, Steven (2015). "12.4 Chemical chaos and attractor reconstruction". Nonlinear dynamics and chaos: with applications to physics, biology, chemistry, and engineering (Second ed.). Boulder, CO. ISBN 978-0-8133-4910-7. OCLC 842877119.{{cite book}}: CS1 maint: location missing publisher (link)
  • ^ Fraser, Andrew M.; Swinney, Harry L. (1986-02-01). "Independent coordinates for strange attractors from mutual information". Physical Review A. 33 (2): 1134–1140. Bibcode:1986PhRvA..33.1134F. doi:10.1103/PhysRevA.33.1134. PMID 9896728.
  • Further reading[edit]

    External links[edit]


    Retrieved from "https://en.wikipedia.org/w/index.php?title=Takens%27s_theorem&oldid=1228762402"

    Category: 
    Theorems in dynamical systems
    Hidden categories: 
    CS1 maint: location missing publisher
    Articles with short description
    Short description is different from Wikidata
    Articles lacking in-text citations from September 2020
    All articles lacking in-text citations
    CS1 maint: multiple names: authors list
     



    This page was last edited on 13 June 2024, at 01:42 (UTC).

    Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Mobile view



    Wikimedia Foundation
    Powered by MediaWiki