Loading...
Please wait, while we are loading the content...
Similar Documents
Fast iteration of cocycles over rotations and computation of hyperbolic bundles.
| Content Provider | CiteSeerX |
|---|---|
| Author | Huguet, Gemma De, Rafael Llave, La Sire, Yannick |
| Abstract | Abstract. We present numerical algorithms that use small requirements of storage and operations to compute the iteration of cocycles over a rotation. We also show that these algorithms can be used to compute efficiently the stable and unstable bundles and the Lyapunov exponents of the cocycle. 1. Introduction. The goal of this paper is to describe efficient algorithms to compute iterations of matrix cocycles over rotations (quasi-periodic cocycles). These quasi-periodic matrix cocycles appear naturally in the study of the variational equations around a quasi-periodic solution [8] and in the study of Schrödinger equations over a quasi-periodic potential [18, 2, 17]. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Unstable Bundle Lyapunov Exponent Quasi-periodic Potential Variational Equation Efficient Algorithm Quasi-periodic Solution Quasi-periodic Cocycles Small Requirement Schr Dinger Equation Present Numerical Algorithm Matrix Cocycles Quasi-periodic Matrix Cocycles |
| Content Type | Text |
| Resource Type | Article |
