We analyze the problem of stability of a continuous time linear switching system (LSS) versus the stability of its Euler discretization. In case of matrices with real spectrum, we obtain a lower bound for the Euler step size to decide stability. This leads to a method for computing the Lyapunov exponent with a given accuracy and with a guaranteed computational cost. Our approach is based on the analysis of Chebyshev systems of exponents.

Analysing the Stability of Linear Systems via Exponential Chebyshev Polynomials

PROTASOV, Vladimir
2016-01-01

Abstract

We analyze the problem of stability of a continuous time linear switching system (LSS) versus the stability of its Euler discretization. In case of matrices with real spectrum, we obtain a lower bound for the Euler step size to decide stability. This leads to a method for computing the Lyapunov exponent with a given accuracy and with a guaranteed computational cost. Our approach is based on the analysis of Chebyshev systems of exponents.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11697/111809
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 6
social impact