Computing Sacker-Sell spectra in discrete time dynamical systems

In this paper we develop two boundary value methods for detecting Sacker-Sell spectra in discrete time dynamical systems. The algorithms are advancements of earlier methods for computing projectors of exponential dichotomies. The first method is based on the projector residual PP − P. If this residual is large, then the difference equation has no exponential dichotomy. A second criterion for detecting Sacker-Sell spectral intervals is the norm of end points of the solution of a specific boundary value problem. Refined error estimates for the underlying approximation process are given and the resulting algorithms are applied to an example with known continuous Sacker-Sell spectrum, as well as to the variational equation along orbits of Hénon’s map

Computing covariant vectors, Lyapunov vectors, Oseledets vectors, and dichotomy projectors: a comparative numerical study

Covariant vectors, Lyapunov vectors, or Oseledets vectors are increasingly being used for a variety of model analyses in areas such as partial differential equations, nonautonomous differentiable dynamical systems, and random dynamical systems. These vectors identify spatially varying directions of specific asymptotic growth rates and obey equivariance principles. In recent years new computational methods for approximating Oseledets vectors have been developed, motivated by increasing model complexity and greater demands for accuracy. In this numerical study we introduce two new approaches based on singular value decomposition and exponential dichotomies and comparatively review and improve two recent popular approaches of Ginelli et al. (2007) and Wolfe and Samelson (2007). We compare the performance of the four approaches via three case studies with very different dynamics in terms of symmetry, spectral separation, and dimension. We also investigate which methods perform well with limited data