Open AccessStability conditions for linear discrete‐time switched systems in block companion form
Author(s) -
De Iuliis Vittorio,
D'Innocenzo Alessandro,
Germani Alfredo,
Manes Costanzo
Publication year - 2020
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2020.0754
Subject(s) - discrete time and continuous time , block (permutation group theory) , control theory (sociology) , mathematics , stability (learning theory) , lyapunov function , linear system , simple (philosophy) , state space , computation , computer science , control (management) , algorithm , nonlinear system , combinatorics , mathematical analysis , philosophy , statistics , physics , epistemology , artificial intelligence , machine learning , quantum mechanics
Switched models whose dynamic matrices are in block companion form arise in theoretical and applicative problems such as representing switched ARX models in state‐space form for control purposes. Inspired by some insightful results on the delay‐independent stability of discrete‐time systems with time‐varying delays, in this work, the authors study the arbitrary switching stability for some classes of block companion discrete‐time switched systems. They start from the special case in which the first block‐row is made of permutations of non‐negative matrices, deriving a simple necessary and sufficient stability condition under arbitrary switching. The condition is computationally less demanding than the sufficient‐only existence of a linear common Lyapunov function. Then, both non‐negativity and combinatorial assumptions are dropped, at the expense of introducing conservatism. Some implications on the computation of the joint spectral radius for the aforementioned families of matrices are illustrated.