An iterative graph-lifting algorithm that automatically refines path-complete graphs via analysis of active constraints to approximate the joint spectral radius of switched linear systems.
A charac- terization of lyapunov inequalities for stability of switched systems,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Iterative graph lifting for automatic design of path-complete stability certificates
An iterative graph-lifting algorithm that automatically refines path-complete graphs via analysis of active constraints to approximate the joint spectral radius of switched linear systems.