arXiv Analytics

Sign in

arXiv:1503.03034 [math.OC]AbstractReferencesReviewsResources

Efficient Method for Computing Lower Bounds on the $p$-radius of Switched Linear Systems

Masaki Ogura, Victor M. Preciado, Raphaël Jungers

Published 2015-03-10Version 1

This paper proposes lower bounds on a quantity called $L^p$-norm joint spectral radius, or in short, $p$-radius, of a finite set of matrices. Despite its wide range of applications to, for example, stability analysis of switched linear systems and the equilibrium analysis of switched linear economical models, algorithms for computing the $p$-radius are only available in a very limited number of particular cases. The proposed lower bounds are given as the spectral radius of an average of the given matrices weighted via Kronecker products and do not place any requirements on the set of matrices. We show that the proposed lower bounds theoretically extend and also can practically improve the existing lower bounds. A Markovian extension of the proposed lower bounds is also presented.

Related articles: Most relevant | Search more
arXiv:1504.03761 [math.OC] (Published 2015-04-15)
Lower Bounds on Complexity of Lyapunov Functions for Switched Linear Systems
arXiv:2312.08190 [math.OC] (Published 2023-12-13)
Stability Analysis of Switched Linear Systems with Neural Lyapunov Functions
arXiv:2308.10591 [math.OC] (Published 2023-08-21)
Feedback rectifiable pairs and stabilization of switched linear systems