Lyapunov characteristic exponents are indicators of the nature and of the stability properties of solutions of differential equations. The estimation of Lyapunov exponents of algebraic multiplicity greater than 1 is troublesome. In this work, we intuitively derive an interpretation of higher multiplicity Lyapunov exponents in forms that occur in simple linear time invariant problems of engineering relevance. We propose a method to determine them from the real Schur decomposition of the state transition matrix of the linear, nonautonomous problem associated with the fiducial trajectory. So far, no practical way has been found to formulate the method as an algorithm capable of mitigating over- or underflow in the numerical computation of the state transition matrix. However, this interesting approach in some practical cases is shown to provide quicker convergence than usual methods like the discrete QR and the continuous QR and Singular Value Decomposition (SVD)methods when Lyapunov exponents with multiplicity greater than one are present.
The Real Schur Decomposition Estimates Lyapunov Characteristic Exponents with Multiplicity Greater Than One
MASARATI, PIERANGELO;TAMER, AYKUT
2016-01-01
Abstract
Lyapunov characteristic exponents are indicators of the nature and of the stability properties of solutions of differential equations. The estimation of Lyapunov exponents of algebraic multiplicity greater than 1 is troublesome. In this work, we intuitively derive an interpretation of higher multiplicity Lyapunov exponents in forms that occur in simple linear time invariant problems of engineering relevance. We propose a method to determine them from the real Schur decomposition of the state transition matrix of the linear, nonautonomous problem associated with the fiducial trajectory. So far, no practical way has been found to formulate the method as an algorithm capable of mitigating over- or underflow in the numerical computation of the state transition matrix. However, this interesting approach in some practical cases is shown to provide quicker convergence than usual methods like the discrete QR and the continuous QR and Singular Value Decomposition (SVD)methods when Lyapunov exponents with multiplicity greater than one are present.File | Dimensione | Formato | |
---|---|---|---|
MASAP05-16.pdf
Accesso riservato
Descrizione: Paper
:
Publisher’s version
Dimensione
521.95 kB
Formato
Adobe PDF
|
521.95 kB | Adobe PDF | Visualizza/Apri |
MASAP_OA_05-16.pdf
Open Access dal 09/03/2017
Descrizione: Paper open access
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
357.74 kB
Formato
Adobe PDF
|
357.74 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.