Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Necessary and sufficient condition for neutral-type delay systems: Polynomial approximations (2406.15581v1)

Published 21 Jun 2024 in eess.SY and cs.SY

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

We haven't generated a summary for this paper yet.