The length of switching intervals of a stable linear system

TL;DR

This paper investigates how restrictions on switching interval lengths affect the stability of linear switching systems, introducing new concepts and algorithms to analyze stability conditions.

Contribution

It introduces the concept of 'cut tail points' for linear operators and develops an algorithm based on Chebyshev-type exponential polynomials to analyze stability.

Findings

Short switching interval stability implies overall stability under certain conditions

Development of an algorithm for constructing Chebyshev-type exponential polynomials

Numerical results demonstrating the effectiveness of the approach

Abstract

The linear switching system is a system of ODE with the time-dependent matrix taking values from a given control matrix set. The system is (asymptotically) stable if all its trajectories tend to zero for every control function. We consider possible mode-dependent restrictions on the lengths of switching intervals which keeps the stability of the system. When the stability of trajectories with short switching intervals implies the stability of all trajectories? To answer this question we introduce the concept of "cut tail points" of linear operators and study them by the convex analysis tools. We reduce the problem to the construction of Chebyshev-type exponential polynomials, for which we derive an algorithm and present the corresponding numerical results.