Abstract
Linear perturbations of solutions of dynamical systems exhibit different asymptotic growth rates, which are naturally characterized by so-called covariant Lyapunov vectors (CLVs). Due to an increased interest of CLVs in applications, several algorithms were developed to compute them. The Ginelli algorithm is among the most commonly used. Although several properties of the algorithm have been analyzed, there exists no mathematically rigorous convergence proof yet. In this article we extend existing approaches in order to construct a projector-based convergence proof of Ginelli's algorithm. One of the main ingredients will be an asymptotic characterization of CLVs via the Multiplicative Ergodic Theorem. In the proof, we keep a rather general setting allowing even for degenerate Lyapunov spectra.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
