We present a su cient condition for asymptotic stability of a switched linear system in terms of the Lie algebra generated by the individual matrices. Namely, if this Lie algebra is solvable, then the switched system is exponentially stable for arbitrary switching. In fact, we show that any family o
A commutation condition for stability analysis of switched linear descriptor systems
β Scribed by Guisheng Zhai; Xuping Xu
- Publisher
- Elsevier
- Year
- 2011
- Tongue
- English
- Weight
- 265 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1751-570X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we present a new stability analysis of switched systems. We introduce the concepts of minimum/maximum holding time and redundancy as a tool for Lyapunov stability. The presented results are more practical than the existing stability analyses that introduce multiple Lyapunov functions.
For linear descriptor systems of the form BαΊ = Ax + Cu, y = Ox, this paper constructs reduced order systems associated with a given part of the finite spectrum of the pencil It is known that the reduction can be obtained by a block diagonalization of the generalized Schur decomposition of P(Ξ»). In