Derives an entropy-based guarantee on the sum-of-squares upper bound for the joint spectral radius of constrained switched systems and a dimension-reduction technique for low-rank matrix sets.
Efficient method for computing lower bounds on the p-radius of switched linear systems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An entropy-based bound for the computational complexity of a switched system
Derives an entropy-based guarantee on the sum-of-squares upper bound for the joint spectral radius of constrained switched systems and a dimension-reduction technique for low-rank matrix sets.