Fast iteration of cocycles over rotations and computation of hyperbolic bundles
From MaRDI portal
(Redirected from Publication:489836)
Abstract: In this paper, we develop numerical algorithms that use small requirements of storage and operations for the computation of hyperbolic cocycles over a rotation. We present fast algorithms for the iteration of the quasi-periodic cocycles and the computation of the invariant bundles, which is a preliminary step for the computation of invariant whiskered tori.
Recommendations
- Numerical computation of rotation numbers of quasi-periodic planar curves
- Rotation number and Lyapunov exponent in two-dimensional maps
- Numerical determination of the continued fraction expansion of the rotation number
- RIGOROUS NUMERICAL ESTIMATION OF LYAPUNOV EXPONENTS AND INVARIANT MEASURES OF ITERATED FUNCTION SYSTEMS AND RANDOM MATRIX PRODUCTS
- Set-oriented numerical computation of rotation sets
Cited in
(5)- KAM tori and whiskered invariant tori for non-autonomous systems
- Computation of quasi-periodic normally hyperbolic invariant tori: algorithms, numerical explorations and mechanisms of breakdown
- Solving the Babylonian problem of quasiperiodic rotation rates
- Transition state theory with quasi-periodic forcing
- Quantitative quasiperiodicity
This page was built for publication: Fast iteration of cocycles over rotations and computation of hyperbolic bundles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489836)