2012
DOI: 10.1007/s00220-012-1548-2
|View full text |Cite
|
Sign up to set email alerts
|

Oscillator Synchronisation under Arbitrary Quasi-periodic Forcing

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
36
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 27 publications
(39 citation statements)
references
References 29 publications
3
36
0
Order By: Relevance
“…Such assumption can be seen as a time-reversibility condition on the Hamiltonian system. For non-convex Hamiltonians (1.3) with r = 1, the same result of persistence of at least one invariant torus has been proved in [11] without assuming Hypothesis 2 on the perturbation; the result has been extended to more general one-dimensional systems in [12]. Strictly speaking, Cheng's result does not imply the result in [11,12], because the unperturbed Hamiltonian is not convex; however Cheng's method can be adapted to such a case; see [13] for an explicit implementation.…”
Section: Introductionmentioning
confidence: 56%
See 1 more Smart Citation
“…Such assumption can be seen as a time-reversibility condition on the Hamiltonian system. For non-convex Hamiltonians (1.3) with r = 1, the same result of persistence of at least one invariant torus has been proved in [11] without assuming Hypothesis 2 on the perturbation; the result has been extended to more general one-dimensional systems in [12]. Strictly speaking, Cheng's result does not imply the result in [11,12], because the unperturbed Hamiltonian is not convex; however Cheng's method can be adapted to such a case; see [13] for an explicit implementation.…”
Section: Introductionmentioning
confidence: 56%
“…and set χ n (x) = χ(x/ρ n ) for n ≥ 0 and χ −1 (x) = 1. Set also Ψ n (x) = χ n−1 (x) − χ n (x) for n ≥ −1; see Figure 1 in [11]. Next, we introduce the sequences {m n , p n } n≥0 , with m 0 = 0 and, for all n ≥ 0, m n+1 = m n + p n + 1, where p n := max{q ∈ Z + : α mn (ω) < 2α mn+q (ω)}, with α m (ω) defined in (1.6).…”
Section: Renormalised Trees: Node Factors and Propagatorsmentioning
confidence: 99%
“…It follows that we obtain a well defined approximate solution to all orders under the condition (4.9); for instance one can adapt the argument given in Appendix H of [CG12].…”
Section: Existence Of Solutions Of the Zeroth Order Termmentioning
confidence: 99%
“…Chaotic motion has been found in some nonintegrable systems [30], and periodic doubling or quasi-periodic doubling sequences have been seen as the different routes to chaos [31,32]. Substituting ψ = ϕ(ξ )e iϑ , n = φ(ξ ) into Equation (4), where ξ = r 11 x + r 12 y + r 13 s − r 14 z and ϑ = r 21 x + r 22 y + r 23 s − r 24 z, we have …”
Section: Chaotic and Periodic Motions Of Equation (4)mentioning
confidence: 99%