Efficient method for computing lower bounds on the p-radius of switched linear systems
From MaRDI portal
(Redirected from Publication:313316)
Efficient method for computing lower bounds on the \(p\)-radius of switched linear systems
Efficient method for computing lower bounds on the \(p\)-radius of switched linear systems
Abstract: This paper proposes lower bounds on a quantity called -norm joint spectral radius, or in short, -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 -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.
Recommendations
- A limit formula for joint spectral radius with \(p\)-radius of probability distributions
- Hybrid Systems: Computation and Control
- Fast methods for computing the \(p\)-radius of matrices
- Analysis of the joint spectral radius via Lyapunov functions on path-complete graphs
- Lower bounds and dense discontinuity phenomena for the stabilizability radius of linear switched systems
Cites work
- scientific article; zbMATH DE number 1003847 (Why is no real title available?)
- scientific article; zbMATH DE number 2136426 (Why is no real title available?)
- scientific article; zbMATH DE number 920746 (Why is no real title available?)
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A survey of stability of stochastic systems
- Characterization of $L^p $-Solutions for the Two-Scale Dilation Equations
- Fast methods for computing the \(p\)-radius of matrices
- Generalized Helmert-Ledermann orthogonal matrices and ROM simulation
- Generalized joint spectral radius and stability of switching systems
- JSR: a toolbox to compute the joint spectral radius
- Kronecker products and matrix calculus in system theory
- On Minimizing the Special Radius of a Nonsymmetric Matrix Function: Optimality Conditions and Duality Theory
- Stability analysis of positive semi-Markovian jump linear systems with state resets
- Subdivision schemes in \(L_ p\) spaces
- The Berger-Wang formula for the Markovian joint spectral radius
- The \(p\)-norm joint spectral radius for even integers
- The generalized joint spectral radius. A geometric approach
Cited in
(10)- A limit formula for joint spectral radius with \(p\)-radius of probability distributions
- An improved method of ultimate bound computation for linear switched systems with bounded disturbances
- Fast approximation of the \(p\)-radius, matrix pressure, or generalized Lyapunov exponent for positive and dominated matrices
- Upper bound estimation of the spectral abscissa for switched linear systems via coordinate transformations.
- Fast methods for computing the \(p\)-radius of matrices
- An inequality for the matrix pressure function and applications
- scientific article; zbMATH DE number 2073944 (Why is no real title available?)
- Approximating the spectral abscissa for switched linear systems via coordinate transformations
- scientific article; zbMATH DE number 2085328 (Why is no real title available?)
- Linear switched dynamical systems on graphs
This page was built for publication: Efficient method for computing lower bounds on the \(p\)-radius of switched linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313316)
