On the Length of Switching Intervals of a Stable Dynamical System

A linear switching system is a system of linear ODEs with time-dependent matrix taking values in a given control matrix set. The system is asymptotically stable if all its trajectories tend to zero for every control matrix function. Mode-dependent restrictions on the lengths of switching intervals can be imposed. Does the system remain stable after removal of the restrictions? When does the stability of the trajectories with short switching intervals imply the stability of all trajectories? The answers to these questions are given in terms of the “tail cut-off points” of linear operators. We derive an algorithm to compute them by applying Chebyshev-type exponential polynomials.