Two termination criteria for transient phases in the Ginelli CLV algorithm are compared on two Hamiltonian systems, with an adaptation proposed to avoid alignment issues that degrade accuracy in center-subspace computations over long backward times.
Noethen,Computing Covariant Lyapunov Vectors – A Convergence Analysis of Ginelli’s Algorithm, Ph.D
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
nlin.CD 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the efficient numerical computation of covariant Lyapunov vectors
Two termination criteria for transient phases in the Ginelli CLV algorithm are compared on two Hamiltonian systems, with an adaptation proposed to avoid alignment issues that degrade accuracy in center-subspace computations over long backward times.