Tree-Based Algorithms for the Stability of Discrete-Time Switched Linear Systems Under Arbitrary and Constrained Switching

2019 ◽  
Vol 64 (9) ◽  
pp. 3823-3830
Author(s):  
Fabio Dercole ◽  
Fabio Della Rossa
Keyword(s):  
Linear Systems ◽  
Discrete Time ◽  
Switched Linear Systems ◽  
The Stability

Stability of Discrete-Time Switched Linear Systems with Saturation Arithmetic

2013 ◽  
Vol 427-429 ◽  
pp. 1319-1323
Author(s):  
Meng Hua Zhang ◽  
Xin Gong Cheng ◽  
Xi Ju Zong
Keyword(s):  
Linear Systems ◽  
Discrete Time ◽  
Stability Condition ◽  
Closed Loop ◽  
Switched Linear Systems ◽  
The Stability ◽  
Saturation Arithmetic ◽  
Theoretical Results

This paper addresses a strategy for the stability of discrete-time switched linear systems with saturation arithmetic. It is of closed-loop nature and is designed from the solution of what we called Lyapunov-Metzler inequalities from which the stability condition is expressed. The theoretical results are illustrated by means of examples.

Sign in / Sign up

Export Citation Format

Share Document