Periodic switching stability implies absolute stability for pairs in dimension at least four
Let , with , be an arbitrary pair satisfying condition (1.3a), namely that the matrices share a common non-strict Lyapunov matrix. A system is periodically switched stable if for every finite word and every , and it is absolutely stable if . Periodic switching stability conjecture. If is periodically switched stable, then it is absolutely stable. Equivalently, if , there exists at least one word for some such that
This problem concerns the relationship between periodic and arbitrary switching for pairs of discrete-time linear systems with a common non-strict Lyapunov matrix. The paper establishes related stability and spectral finiteness results in lower dimensions, while the asserted implication for is posed for further study.
References
- Xiongping Dai, Yu Huang and Mingqing Xiao, “Stability Criteria via Common Non-strict Lyapunov Matrix for Discrete-time Linear Switched Systems”, arXiv:1108.0239 (2011).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.