Abstract
In this paper we compute the root-mean-square (RMS) gain of a switched linear system when the interval between consecutive switchings is large. The algorithm proposed is based on the fact that a given constant γ provides an upper bound on the RMS gain whenever there is a separation between the stabilizing and the antistabilizing solutions to a set of γ-dependent algebraic Riccati equations. The motivation for this problem is the application of robust stability tools to the analysis of hybrid systems.
Cite
CITATION STYLE
Hespanha, J. P. (2002). Computation of root-mean-square gains of switched linear systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2289, pp. 239–252). Springer Verlag. https://doi.org/10.1007/3-540-45873-5_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
