2012
DOI: 10.1063/1.4737205
|View full text |Cite
|
Sign up to set email alerts
|

Collision of invariant bundles of quasi-periodic attractors in the dissipative standard map

Abstract: We perform a numerical study of the breakdown of hyperbolicity of quasi-periodic attractors in the dissipative standard map. In this study, we compute the quasi-periodic attractors together with their stable and tangent bundles. We observe that the loss of normal hyperbolicity comes from the collision of the stable and tangent bundles of the quasi-periodic attractor. We provide numerical evidence that, close to the breakdown, the angle between the invariant bundles has a linear behavior with respect to the per… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

2
42
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 41 publications
(46 citation statements)
references
References 26 publications
(23 reference statements)
2
42
0
Order By: Relevance
“…For twist mappings it has been implemented in [CdlL09,CdlL10a,FM12]. For dissipative systems it has been implemented in [CC10,CF12].…”
Section: 3mentioning
confidence: 99%
“…For twist mappings it has been implemented in [CdlL09,CdlL10a,FM12]. For dissipative systems it has been implemented in [CC10,CF12].…”
Section: 3mentioning
confidence: 99%
“…Of course, the equation (1.3) will have to be supplemented by some normalization conditions, which ensure that the solutions are locally unique. We refer to [CdlL09,CdlL10a,dlLR91,CF12] for a method to find invariant curves that solve the invariance equation (1.3) numerically. Our main result, Theorem 12, shows that, if there is a solution of (1.3) for ε = 0 (the symplectic case), which satisfies some mild non-degeneracy conditions, we can find K ε and µ ε defined for a set G of ε.…”
Section: Introductionmentioning
confidence: 99%
“…This method is suitable for application to computer assisted proofs. (For examples of such applications see [3,7,14,19,22], amongst others.) We believe that our approach to Melnikov method (from sections 1.1, 1.2, and 3) could also be successfully combined with [2].…”
Section: Introductionmentioning
confidence: 99%