Search

This paper deals with a new approach to develop an envelope that engulfs all poles of a time-delay system. Through linear matrix inequalities, we are able to determine envelopes for retarded and neutral time-delay systems. The envelopes proposed are not only tighter than the ones in the literature, but, with our procedure, they can also be applied to verify the stability of the system and design state-feedback controllers, which cope with design requirements regarding $\alpha$ -stability. [ABSTRACT FROM AUTHOR]

In this technical note we present a stability analysis approach for polynomially-dependent one-parameter systems. The approach, which appears to be conceptually appealing and computationally efficient and is referred to as an eigenvalue perturbation approach, seeks to characterize the analytical and asymptotic properties of eigenvalues of matrix-valued functions or operators. The essential problem dwells on the asymptotic behavior of the critical eigenvalues on the imaginary axis, that is, on how the imaginary eigenvalues may vary with respect to the varying parameter. This behavior determines whether the imaginary eigenvalues cross from one half plane into another, and hence plays a critical role in determining the stability of such systems. Our results reveal that the eigenvalue asymptotic behavior can be characterized by solving a simple generalized eigenvalue problem, leading to numerically efficient stability conditions. [ABSTRACT FROM AUTHOR]

A standard approach in analyzing dynamical systems consists in identifying and understanding the eigenvalues bifurcations when crossing the imaginary axis. Efficient methods for crossing imaginary roots identification exist. However, to the best of the author's knowledge, the multiplicity of such roots was not deeply investigated. In recent papers by the authors [1], [2], it is emphasized that the multiplicity of the zero spectral value can exceed the number of the coupled scalar delay-differential equations and a constructive approach Vandermonde-based allowing to an adaptive bound for such a multiplicity is provided. Namely, it is shown that the zero spectral value multiplicity depends on the system structure (number of delays and number of non zero coefficients of the associated quasipolynomial) rather than the degree of the associated quasipolynomial [3]. This technical note extends the constructive approach in investigating the multiplicity of crossing imaginary roots $j\omega$ where $\omega\neq 0$ and establishes a link with a new class of functional confluent Vandermonde matrices. A symbolic algorithm for computing the LU-factorization for such matrices is provided. As a byproduct of the proposed approach, a bound sharper than the Polya-Szegö generic bound arising from the principle argument is established. [ABSTRACT FROM AUTHOR]

Obtaining the Puiseux series of multiple imaginary (characteristic) roots (MIRs) is a fundamental issue in the stability analysis of time-delay systems. However, to the best of the authors' knowledge, this issue has not been fully investigated up to date. This note focuses on the Puiseux series expansion of MIRs of linear time-invariant systems including commensurate delays. For an MIR of any multiplicity, we propose an algorithm for defining the structure of the Puiseux series, as well as the explicit computation of the corresponding coefficients. By using the proposed method, we can find all the Puiseux series corresponding to all the root loci. [ABSTRACT FROM AUTHOR]

In this note, we study the stability properties of linear neutral delay systems. We consider systems described by both neutral differential-difference and state-space equations, and we seek to determine the delay margin of such systems, that is, the largest range of delay values for which a neutral delay system may preserve its stability. In both cases, we show that the delay margin can be found by computing the eigenvalues and generalized eigenvalues of certain constant matrices, which can be executed efficiently and with high precision. The results extend previously known work on retarded systems, and demonstrate that similar stability tests exist for neutral systems; in particular, the tests require essentially the same amount of computation required for retarded systems. [ABSTRACT FROM AUTHOR]