Papers
Topics
Authors
Recent
Search
2000 character limit reached

Necessary and sufficient condition for neutral-type delay systems: Polynomial approximations

Published 21 Jun 2024 in eess.SY and cs.SY | (2406.15581v1)

Abstract: A new necessary and sufficient stability test in a tractable number of operations for linear neutral-type delay systems is introduced. It is developed in the Lyapunov-Krasovskii framework via functionals with prescribed derivatives. The necessary conditions, which stem from substituting any polynomial approximation of the functional argument, reduce to a quadratic form of monomials whose matrix is independent of the coefficients of the approximation under consideration. In the particular case of Chebyshev polynomials, the functional approximation error is quantified, leading to an estimate of the order of approximation such that the positive semi-definiteness of the functional is verified. Some examples illustrate the obtained results.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.