|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 95 van 114 gevonden artikelen
| Titel: |
Rotation numbers for quasi-periodically forced monotone circle maps |
| Auteur: |
Stark, J. Feudel, U. Glendinning, P. A. Pikovsky, A. |
| Verschenen in: |
Dynamical systems |
| Paginering: | Jaargang 17 (2002) nr. 1 pagina's 1-28 |
| Jaar: |
2002-03-01 |
| Inhoud: |
Rotation numbers have played a central role in the study of (unforced) monotone circle maps. In such a case it is possible to obtain a priori bounds of the form „ - 1/n ≤(1/n)(yn - y0) ≤„ + 1/n, where (1/n)(yn - y0) is an estimate of the rotation number obtained from an orbit of length n with initial condition y0, and „ is the true rotation number. This allows rotation numbers to be computed reliably and efficiently. Although Herman has proved that quasi-periodically forced circle maps also possess a well-defined rotation number, independent of initial condition, the analogous bound does not appear to hold. In particular, two of the authors have recently given numerical evidence that there exist quasi-periodically forced circle maps for which yn - y0 - „n is not bounded. This renders the estimation of rotation numbers for quasi-periodically forced circle maps much more problematical. In this paper, a new characterization of the rotation number is derived for quasiperiodically forced circle maps based upon integrating iterates of an arbitrary smooth curve. This satisfies analogous bounds to above and permits us to develop improved numerical techniques for computing the rotation number. Additionally, the boundedness of yn - y0 - „n is considered. It is shown that if this quantity is bounded (both above and below) for one orbit, then it is bounded for all orbits. Conversely, if for any orbit yn - y0 - „n is unbounded either above or below, then there is a residual set of orbits for which yn - y0 - „n is unbounded both above and below. In proving these results a min-max characterization of the rotation number is also presented. The performance of an algorithm based on this is evaluated, and on the whole it is found to be inferior to the integral based method. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 95 van 114 gevonden artikelen
| << vorige | volgende >> |