Fast iteration of cocyles over rotations and Computation of hyperbolic bundles
classification
🧮 math.DS
keywords
computationalgorithmsbundlescocyclesfasthyperbolicinvariantiteration
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.