An ergodic averaging method to differentiate covariant Lyapunov vectors

Abstract

Covariant Lyapunov vectors or CLVs span the expanding and contracting directions of perturbations along trajectories in a chaotic dynamical system. Due to efficient algorithms to compute them that only utilize trajectory information, they have been widely applied across scientific disciplines, principally for sensitivity analysis and predictions under uncertainty. In this paper, we develop a numerical method to compute the directional derivatives of CLVs along their own directions. Similar to the computation of CLVs, the present method for their derivatives is iterative and analogously uses the second-order derivative of the chaotic map along trajectories, in addition to the Jacobian. We validate the new method on a super-contracting Smale-Williams Solenoid attractor. We also demonstrate the algorithm on several other examples including smoothly perturbed Arnold Cat maps, and the Lorenz attractor, obtaining visualizations of the curvature of each attractor. Furthermore, we reveal a fundamental connection of the CLV self-derivatives with a statistical linear response formula.

28 pages, 13 figures, under review

References in corpus (4)

• Feasibility analysis of ensemble sensitivity computation in turbulent flows
• A computable realization of Ruelle's formula for linear response of statistics in chaotic systems
• Ergodic Sensitivity Analysis of One-Dimensional Chaotic Maps
• Variational optimization and data assimilation in chaotic time-delayed systems with automatic-differentiated shadowing sensitivity

Cited by in corpus (3)

• Computational assessment of smooth and rough parameter dependence of statistics in chaotic dynamical systems
• A trajectory-driven algorithm for differentiating SRB measures on unstable manifolds
• Differentiating densities on smooth manifolds