Pith. sign in

REVIEW

The length of switching intervals of a stable linear system

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2209.12219 v1 pith:YPHLAJUB submitted 2022-09-25 math.OC math.DSmath.FA

classification math.OCmath.DSmath.FA
keywords systemswitchingintervalslinearstabilitytrajectoriescontrolmatrix
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools