Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
99 tokens/sec
Gemini 2.5 Pro Premium
56 tokens/sec
GPT-5 Medium
26 tokens/sec
GPT-5 High Premium
20 tokens/sec
GPT-4o
106 tokens/sec
DeepSeek R1 via Azure Premium
99 tokens/sec
GPT OSS 120B via Groq Premium
507 tokens/sec
Kimi K2 via Groq Premium
213 tokens/sec
2000 character limit reached

A projector-based convergence proof of the Ginelli algorithm for covariant Lyapunov vectors (1802.08461v2)

Published 23 Feb 2018 in math.DS

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.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)