Next Article in Journal
Applications of Extended Kummer’s Summation Theorem
Previous Article in Journal
Explicit Modeling of Multi-Product Customer Orders in a Multi-Period Production Planning Model
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Some Combined Results from Eneström–Kakeya and Rouché Theorems on the Generalized Schur Stability of Polynomials and the Stability of Quasi-Polynomials-Application to Time-Delay Systems

Institute of Research and Development of Processes, Department of Electricity and Electronics, Faculty of Science and Technology, University of the Basque Country (UPV/EHU), 48940 Leioa, Bizkaia, Spain
Mathematics 2024, 12(19), 3023; https://doi.org/10.3390/math12193023 (registering DOI)
Submission received: 21 August 2024 / Revised: 18 September 2024 / Accepted: 23 September 2024 / Published: 27 September 2024

Abstract

:
This paper derives some generalized Schur-type stability results of polynomials based on several forms and generalizations of the Eneström–Kakeya theorem combined with the Rouché theorem. It is first investigated, under sufficiency-type conditions, the derivation of the eventually generalized Schur stability sufficient conditions which are not necessarily related to the zeros of the polynomial lying in the unit open circle. In a second step, further sufficient conditions were introduced to guarantee that the above generalized Schur stability property persists within either the same above complex nominal stability region or in some larger one. The classical weak and, respectively, strong Schur stability in the closed and, respectively, open complex unit circle centred at zero are particular cases of their corresponding generalized versions. Some of the obtained and proved results are further generalized “ad hoc” for the case of quasi-polynomials whose zeros might be interpreted, in some typical cases, as characteristic zeros of linear continuous-time delayed time-invariant dynamic systems with commensurate constant point delays.

1. Introduction

It has to firstly be pointed out that the stability of polynomials is an identical property to the stability of linear time-invariant systems in the sense that a continuous-time linear time-invariant system is asymptotically stable if the poles of its transfer function, that is the zeros of its denominator polynomial are in the open complex half-plane Re s < 0 . In this case, the denominator polynomial of the transfer function is said to be Hurwitz-stable. In the same way, a discrete-time linear time-invariant system is asymptotically stable if the poles of its discretized transfer function, that is, the zeros of its denominator polynomial are in the open complex unit circle centred at zero, z < 1 . In such a case, the denominator polynomial is said to be Schur-stable. The Rouché theorem on zeros is a very useful tool to investigate if the stability of a polynomial persists under a given eventually unstructured perturbation in the event that such a perturbation does not imply increase in the degree of the polynomial. See, for instance, [1] and the references therein.
The idea to test the stability is simple since it suffices to elucidate if all the zeros of the perturbed polynomial in the open stability region are the same as those of the unperturbed one, or equivalently, if there is no extra zero on the open instability region based on the knowledge of the absence of zeros of the unperturbed polynomial in such a region. For that purpose, it suffices to check just a simple inequality on the boundary of the region while it is not necessary to know the exact allocation of the zeros of both polynomials, the unperturbed one (say, the nominal one) and the perturbed one. The same basic idea is extendable to any open region under minimum constraints on the boundary. On the other hand, the Eneström–Kakeya theorem is very popular to elucidate if all the zeros of a polynomial lie within the closed complex unit circle centred at zero, z 1 , provided that all the polynomial coefficients are real and non-negative and they have a non-strict decreasing ordering condition from their highest to their lowest power [2]. Dually, it is also seen as a direct consequence that its open complementary region z > 1 in the complex plane is zero-free. The above property is in fact a weak Schur stability condition since the eventual existence of zeros at the boundary of the complex unit circle means that the polynomial is not Schur-stable (or strictly Schur-stable) but, in fact, critically stable. Some extensions of the above theorem are given in [2] by considering zeros within an annulus of prescribed radii which can be characterized. In [3,4], some further extensions are given for the case of complex coefficients whose moduli are ordered in decreasing order. Some generalizations of the Eneström–Kakeya theorem are given in [5,6] for the case of polynomials with complex coefficients. In particular, in [5], the conditions of positive realness of the coefficients are dropped and, in addition, the hypothesis related to the coefficients monotonically increasing is weakened. In [7], several generalizations of the Eneström–Kakeya are provided which remove the non-negativity conditions of the coefficients of the polynomial. One of them applies to the case of real non-necessarily non-negative coefficients under a condition involving two combined mixed constraints of both non-strictly decreasing ordering and non-strictly increasing ordering types. The two above ordering conditions involve two groups of consecutive modified coefficients which weight the polynomial coefficients through the powers of a positive prescribed real number. Another relevant generalization given in that paper was concerned with mixed non-strict decreasing/increasing ordering conditions leading the zeros of the polynomial to belong to a certain closed annulus. On the other hand, the Cauchy’s classical bound of the moduli of the zeros of a polynomial with complex coefficients is weakened in [8]. See also [9,10,11]. A necessary and sufficient condition which is easy to test to determine whether all the zeros of a polynomial with complex coefficients to lie on the unit circle is provided in [9] as an alternative to previous similar classic theorems stated by Cohn and Schur. The condition is based on the existence of another polynomial with zeros on the unit circle such that it and its reciprocal together satisfy an additive condition which equalizes the tested polynomial. In [11], it is assumed that the ordering of coefficients is strictly decreasing from the highest to the lowest power and that there is a threshold real number larger than the quotient between any two consecutive coefficients in a decreasing order of powers. In that way, it is ensured that there is a zero-free complex region characterized by such a threshold by inspecting those coefficients. In [12], the stability of multidimensional discrete polynomials is discussed by proposing a modified Jury tabulation and a sign criterion. The proposed criterion extends Jury´s necessary and sufficient criterion on the Schur stability of single-valued polynomials to multivalued discrete polynomials.
Complex functions defined by polynomials whose coefficients are analytic transcendent complex functions, which come from a ring, in the same complex argument as the polynomials, for instance, exponential functions are commonly referred to as quasi-polynomials. Therefore, the coefficients of the quasi-polynomials are periodic functions with an integral period. A typical example of quasi-polynomials are those defining the characteristic equation of linear continuous-time time-invariant systems with commensurate constant point delays; that is, all the delays are integer multiple of the basic minimum one. See, for instance, Refs. [13,14,15,16,17] and some of the references therein. These quasi-polynomials might be described by two-variable polynomials, one variable being the argument of the Laplace transform “ s ”, formally equivalent to the time-derivative operator ” D ” ( D = d / d t ), while the other one is “ z ” with z = z s = e h s . However, the description in two variables gives only eventually sufficiency-type stability conditions since the variable z is in fact a function of s , although it greatly simplifies the stability tests, [13,14,15,16,17], related to the involvement in the stability tests of just the independent Laplace transform argument [16]. It is well-known that the Möbius transformation, which is a bilinear-type transformation in the complex plane, relates the stability of characteristic polynomials associated with linear discrete-time systems (Schur stability) with the stability of polynomials which describe the characteristic equation of linear continuous-time systems (Hurwitz stability). See, for instance, Refs. [17,18,19,20,21] and some references therein. This technique is also worked on in the paper for deriving stability results for characteristic polynomials associated with continuous-time systems associated with discrete-time ones which satisfy the hypotheses for guaranteeing Schur stability based on Eneström–Kakeya-type theorems or their generalizations.
Some recent related results are now briefly described. In [22], some extensions of the Eneström–Kakeya theorem are given under non-strict decreasing conditions from the highest power coefficient to the lowest power one which involve either the even or the odd real polynomial coefficients depending on whether the highest power coefficient is odd. In addition, a supplementary respective positivity condition exists on the first or second coefficient corresponding, respectively, to the zero or first powers of the polynomial. Extensions of the above result are given in [23] by considering complex coefficients which do not follow increasing or decreasing ordering rules.
In [24], some generalizations of the Eneström–Kakeya theorem are given related to the moduli and the real and imaginary parts of the complex coefficients of the polynomial. In particular, ordering conditions are assumed separately for the real and imaginary parts of the polynomial coefficients such that the intended zeros lie in a certain closed annulus. In [25], regions are obtained where no zeros of the polynomial are present and a disc which contains the zeros of the polynomial is also determined when the ordering condition of the coefficients is modified through scalar multiplicative weights for the first and last polynomial coefficients associated, respectively, to the highest and lowest powers of the polynomial variable.
Some further research on the stability of dynamics systems has been developed in [26,27,28] which is not based Eneström–Kakeya-type theorems. In particular, and based on the concept of stable functions, some sufficiency-type conditions for asymptotic stability, exponential stability, and uniform exponential stability of continuous linear time-varying systems are investigated in [26] through differential Lyapunov inequalities. In [27], it is discussed how higher-order averaging is useful to overcome certain drawbacks arising from the direct application of the averaging theorem. Two higher-order averaging methodologies are brought together, namely the perturbation theory through a near-identity transformation and the chronological calculus by means of Lie algebraic tools. Two applications are also discussed in that paper in light of the given theory, namely the Kapitza pendulum problem and the application of flapping flight dynamics associated with micro-air-vehicles or insect flight. On the other hand, some special types of time-varying and/or nonlinear systems are discussed in [28]. The performed research is mainly concerned with their stability properties. The systems dealt with are borrowed from certain industrial models such as complex nonlinear saturated systems, uncertain fuzzy differential systems, Lurie-type nonlinear systems subject to time-varying delay feedback, neutral-type delay differential equations, differential inclusions with nonlinear integral delays, and some chaotic communication systems. On the other hand, more recently, a control scheme for an unknown multivariable nonlinear system is proposed in [29] that is based on the implementation of an adaptive fuzzy controller together with a robust controller which possesses a Nussbaum-type nonlinear gain function. The scheme´s closed-loop stability is guaranteed. Also, in [30], an adaptive decentralized neural network control strategy based on an event-triggered mechanism is investigated for a class of nonlinear multi-input multi-output large-scale nonlinear systems subject to input saturation, external disturbances, and unmeasurable state. See also [31] for related control analysis and designs.
The main motivation of this research is to provide easy stability results of sufficiency type for discrete polynomials based on simply testing the positivity and monotonicity of the ordered polynomial coefficients based on basic and extended Eneström–Kakeya-type theorems with the eventual concourse of the Rouché theorem on zeros to evaluate robustness under deviations of the coefficients of the standard monotonicity conditions. It can be noticed that, although they are just of sufficiency type, the stability conditions provided by Eneström–Kakeya-type theorems are, in general, easier and faster and more practical to test than Jury´s stability tests or alternative tests based on the Möbius transformation which transforms the unit circle into the left-hand-side complex plane allowing the use of the Routh–Hurwitz stability test. This facility is obvious since Eneström–Kakeya-type theorems only need, in general, to test monotonicity conditions on the polynomial coefficients of generalized monotonicity conditions under the use of multiplicative constants for such coefficients. The main objective and contribution of this paper is to give and to prove some simple to test results which are attained by combining the celebrated Eneström–Kakeya and Rouché theorems of zeros for the generalized Schur stability of discrete polynomials. For such a purpose, it is supposed that the allocation of the polynomial zeros in a prescribed circle, not necessarily the unit circle of the complex plane centred at zero. In this context, the analysis first characterizes, under sufficiency-type conditions, an eventually generalized Schur stability property. Such a generalization is made under prescribed conditions on the coefficients of the polynomial by using different versions or extensions of the Eneström–Kakeya theorem. Those conditions are monotonicity constraints on the ordered polynomial coefficients. In a second step, it is investigated, under further sufficient conditions, how the generalized Schur stability property persists in either the same above complex nominal stability region or in some larger one which contains the nominal one, provided that the nominal polynomial is perturbed. The perturbation of the coefficients of the polynomial can consist, in particular, of a lot of the “a priori” conditions assumed about the coefficient of the nominal polynomial by either the Eneström–Kakeya theorem or some of its invoked generalizations. This two-step-based procedure gives a flexible “modus operandi” methodology to derive the sufficient conditions of generalized Schur stability since the first step can be addressed with convenience by using a reference (or nominal) polynomial which fulfils the decreasing ordering condition of the coefficients from the highest to the lowest power of the complex argument z. The second step rearranges the current polynomial as being a perturbed one of the above reference polynomial. The final stability conditions are easier to achieve as the perturbation between both polynomials becomes smaller. The degree of the perturbed polynomial is assumed not to be higher than that of the nominal one. A set of related results in this context are established and proved and discussed in Section 2. Some examples are discussed, some of them linked to classical control theory problems of continuous-time and discrete-time stability. Section 3 is devoted to the generalization of some of the former results to the case of quasi-polynomials whose zeros might be interpreted, in some cases, as being the characteristic zeros of linear continuous-time delayed dynamic systems with commensurate constant point delays. Some further examples are provided and discussed in Section 4. Finally, conclusions and potential guidelines for future related work end the paper.

Notation

R 0 + = r R : r 0 = R + 0
R = r R : r < 0 ;   R 0 = r R : r 0 = R 0
Z + = r Z : r > 0 ;   Z 0 + = r Z : r 0 = Z + 0
Z = r Z : r < 0 ;   Z 0 = r Z : r 0 = Z 0
C + = r C : Re r > 0 ;   C 0 + = r C : Re r 0 = C + 0
C = r C : Re r < 0 ;   C 0 = r C : Re r 0 = C 0
n ¯ = 1 , 2 , , n
Let M be a square real or complex matrix. Then, its set of eigenvalues is its spectrum set denoted by s p M . If M is non-Hurwitzian, equivalently referred to as not being a stability matrix, (i.e., it has unstable and or critically stable eigenvalues in C 0 + ), then its non-stable spectrum s p M = s s p M : Re s 0 s p M is nonempty. If M is non-convergent (i.e., non-stable in the discrete context), then its non-convergent spectrum, denoted similarly as above as s p M = z s p M : z 1 s p M , is nonempty.
The complex imaginary unit is denoted by i = 1 .
Let P z be a polynomial of degree n 1 and real coefficients defined by P z = j = 0 n p j z j . It is said that it fulfils the weak positivity ordering condition (WPOc) if p j p j 1 0 ; j n ¯ 0 , and it is said that it fulfils the strong positivity ordering condition (SPOc) if p j > p j 1 > 0 ; j n ¯ 0 . If P z satisfies the SPOc, then it also trivially satisfies the WPOc. If p j = 0 for j m ¯ 0 and m < n , then P z = z m + 1 j = 0 m p j z j so that the zeros of P z are those of P 1 z = j = 0 m p j z j plus a zero z = 0 of multiplicity m + 1 . And the eventual properties derived from the WPOc and SPOc for the nonzero zeros of P z are those of P 1 z .
P z is weakly Schur ρ -stable ( WS ρ S ) if all its zeros of lie in z ρ ,respectively, it is strongly Schur ρ -stable ( SS ρ S ) if all its zeros of lie in z < ρ . The concept of P z being SS 1 S coincides with the classical concept of Schur stability.

2. Main Results

2.1. Basic Results

In [10,11], the following results are summarized for a polynomial P z = j = 0 n p j z j , of real coefficients and degree n 1 , concerning the classical Eneström–Kakeya theorem:
Theorem A 
(Eneström–Kakeya theorem [10,11]). If the WPOc holds, then all the zeros of  P z  lie in  z 1 .
Theorem B 
([11]). If  p j R + ;  j n ¯ 0  and if the SPOc holds, then all the zeros  P z  lie in  z t = max j n ¯ p j 1 / p j < 1 .
The subsequent definitions and lemma are useful for further use concerning its stability.
Definition 1. 
P z  is weakly Schur  ρ -stable ( WS ρ S ) if all the zeros of  P z  lie in  z ρ .
Definition 2. 
P z  is strongly Schur  ρ -stable ( SS ρ S ) if all the zeros of  P z  lie in  z < ρ .
From the above definitions, we directly obtain the following:
Lemma 1. 
If  P z  is  SS ρ S , then it is  WS ρ S .
If  P z  is  WS ρ S , then it is  SS ρ + ε S  for any real  ε > 0 .
Remark 1. 
If  ρ = 1  and  P z  is  SS 1 S , then all its zeros of  P z  lie in  z < 1  which leads to the usual definition of the Schur stability of polynomials. This property is “strong” in the sense that the zeros lie in an open complex unit circle centred at zero. Its real version is that  P z  is  WS 1 S  if its zeros lie in  z 1 . It can be pointed out that, on the other hand, it is well-known that a discrete linear time-invariant system whose characteristic polynomial is  SS ρ S , for  ρ 0 , 1 , is globally asymptotically stable in the sense that, for any given finite initial conditions, its solution sequence is bounded and it converges asymptotically to zero in the absence of forcing terms. If its characteristic polynomial has the weaker property of being  WS 1 S  then the system is globally stable in the sense that, for any given finite initial conditions, its solution sequence is bounded in the absence of forcing terms [18].
Remark 2. 
Note from Theorem B, Definitions 1 and 2, and Lemma 1 that if the SPOc holds, then  P z  is WS  max j n ¯ a j 1 / a j S,  SS 1 S  and also SS max j n ¯ a j 1 / a j ε S, for any given real constant  ε 0 , max j n ¯ a j 1 / a j , since  max j n ¯ a j 1 / a j < 1 .
The subsequent result follows directly from the inspection of a polynomial P z , giving Theorems A and B:
Lemma 2. 
Consider the polynomial  P z = j = 0 n p j z j  of real coefficients and degree  n  (i.e.,  p n 0 ). Thus, the following properties hold:
  • If  p 0 0 , then  z = 0  is not a zero of  P z .
  • If  j = 0 n p j > 0 , then  z = 1  is not a zero of  P z .
  • Assume that the WPOc holds. If  n 2  is even and if there is at least one positive even coefficient  p 2 l  for  l m ¯ 0 , then  z = 1  is not a zero of  P z .
  • Assume that the WPOc holds. If  n 1  is odd and, if there is at least one positive even coefficient  p 2 l + 1  for  l m ¯ 0 , then  z = 1  is not a zero of  P z .
  • If  p n > j = 0 n 1 p j > 0 , then there is no zero in  z 1  so that all the zeros of  P z  are in  z < 1 ; thus,  P z  is  SS 1 S .
  • If  1 > ρ p 0 / j = 0 n 1 p j  under the necessary condition that  p 0 ρ j = 0 n 1 p j < j = 0 n 1 p j , then all the zeros of  P z  are in  z ρ < 1 ; thus,  P z  is  WS ρ S  and  SS 1 S .
  • Properties 6 and 7, respectively, are generalized if the polynomial coefficients are complex and  p n > j = 0 n 1 p j > 0 , respectively,  1 > ρ p 0 / j = 0 n 1 p j .
Proof. 
Property 1 follows from P 0 = a 0 . Property 2 follows from P 1 = j = 0 n p j .
To prove Property 3, first note that j = 0 n p j = j = 0 m p 2 k + j = 0 m 1 p 2 k + 1 > 0 if at least one of the polynomial coefficients is positive. If n is even and positive then n = 2 m 2 for some m Z + . Now, if there is at least one positive even coefficient p 2 l for l m ¯ 0 , then z = 1 is not a zero of P z , since then
P 1 = j = 0 n p j 1 j = j = 0 m p 2 j j = 0 m 1 p 2 j + 1 = p 2 l + j l = 0 m p 2 j j = 1 m p 2 j 1 p 2 l + 0 > 0
then P 1 0 and z = 1 is not a zero of P z .
To prove Property 4, note that if n 1 is odd then n = 2 m + 1 for some m Z 0 + so that:
P 1 = j = 0 n p j 1 j = j = 0 m p 2 j j = 0 m p 2 j + 1 = p 2 l + 1 + j = 0 m p 2 j j l = 0 m p 2 j + 1 p 2 l + 0 > 0 = p 2 l + 1 + j = 0 m p 2 j j l = 1 m + 1 p 2 j 1 p 2 l + 1 + 0 > 0
since the property WPOc holds. Then P 1 0 and z = 1 is not a zero of P z .
Property 5 is proved as follows by rewriting P z = P ρ z e i θ z for each complex z = ρ z e i θ z for some positive real numbers ρ z , θ z 0 , 2 π ; thus, if z 0 is a zero of P z , then P z 0 = 0 so that
p n z 0 n = p n ρ z 0 n e i n θ z 0 = j = 0 n 1 p j z 0 j = j = 0 n 1 p j ρ z 0 j e i j θ z 0
so that
p n ρ z 0 n e i n θ z 0 = p n ρ z 0 n e i n θ z 0 = p n ρ z 0 n = j = 0 n 1 p j ρ z 0 j e i j θ z 0 j = 0 n 1 e i j θ z 0 p j ρ z 0 j = j = 0 n 1 p j ρ z 0 j
Assume that ρ z 0 = 1 ( z 0 is on the boundary of z = 1 ). Then p n j = 0 n 1 p j so that if p n > j = 0 n 1 p j then there is no zero in z = 1 . Now, assume that ρ z 0 > 1 ( z 0 is in z > ρ z 0 > 1 ). Then, p n ρ z 0 n j = 0 n 1 p j ρ z 0 j ρ z 0 n j = 0 n 1 p j , and again p n j = 0 n 1 p j , so that if p n > j = 0 n 1 p j then there is no zero in z > 1 and then Property 5 has been proved.
Now, assume that ρ z 0 < 1 ( z 0 is in z < 1 ). Then,
p 0 ρ z 0 0 e i n θ z 0 = p 0 ρ z 0 0 e i 0 θ z 0 = p 0 = j = 1 n p j ρ z 0 j e i j θ z 0 j = 1 n e i j θ z 0 p j ρ z 0 = ρ z 0 j = 0 n 1 p j
which fails if ρ z 0 < p 0 / j = 0 n 1 p j and which holds if 1 > ρ z 0 p 0 / j = 0 n 1 p j under the necessary condition that p 0 < j = 0 n 1 p j . Then, Property 6 has been proved. □
Note that Properties 5 and 6 of Lemma 2 are not a direct consequence of Theorem B since it does not invoke the constraint that the sequence of coefficients from the highest to the lowest power of z are strictly decreasing. Thus, those properties are derived under weaker constraints than those of Theorem B. On the other hand, the extended version of Property 5, invoked in Property 7, for complex polynomial coefficients was firstly obtained for a monic polynomial, i.e., for the case p n = 1 , that is, for the leading coefficient being unity, under the form 1 > j = 0 n 1 p j in [20], but the given proof was much longer and more involved than the above one. See also [21] and some references therein.

2.2. Extended Combined Results with Examples from Theorem A and Rouché’s Theorem

The subsequent result extends Theorem A for the case when the coefficients are not necessarily subject to a WPOc, but the polynomial is a sum of a polynomials subject to a WOPC plus another one which fulfils the Rouché theorem of zeros taking as a reference the one under the WOPc.
Theorem 1. 
Consider two polynomials  P z = j = 0 n p j z j  and  P ˜ z = j = m 1 m p ˜ j z j  of real coefficients and respective degrees  n 1  and  n m m 1 1  such that the WPOc holds. Then, the following properties hold:
(i) 
For any given real  ε > 0 , all the zeros of the polynomial  Q z = P z + P ˜ ( z )  are in  z < 1 + ε  provided that
sup θ 0 , 2 π j = m 1 m 1 + ε j p ˜ j cos j θ + i sin j θ j = 0 n 1 + ε j p j cos j θ + i sin j θ < 1
and a sufficient condition for (1) to hold is  j = m 1 m p ˜ j / p i j i = 0 n p j < 1 + ε m  for any  i n ¯ .
(ii) 
Assume, furthermore, that  P z = j = 0 n p j z j 0  for any complex  z  on the boundary of the unit complex circle centred at zero  z = 1 . Then, all the zeros of the polynomial  Q z = P z + P ˜ ( z )  are in  z < 1  provided that
sup θ 0 , 2 π j = m 1 m p ˜ j cos j θ + i sin j θ j = 0 n p j cos j θ + i sin j θ < 1
and a sufficient condition for (2) to hold is  j = m 1 m p ˜ j / p i j i = 0 n p j < 1  for any  i n ¯ .
Proof. 
From the Eneström–Kakeya theorem, P z has all its zeros in the closed complex circle centred at zero so that all of them also lie in z 1 + ε for any given real constant ε > 0 See, for instance, [1,2]. Now, from the Rouché theorem on zeros, Q z has the same number of zeros in z 1 + ε as P z ; that is, all of them, since both have the same degree, provided that P ˜ z / P z < 1 for any z satisfying z = 1 + ε since P z has no zero in z = 1 + ε , that is, if (6) holds. Property (i) has been proved. Property (ii) is proved in a similar way to Property (ii) by noting that if P z = j = 0 n p j z j 0 for z = 1 then from the Eneström Eneström–Kakeya theorem P z has all its zeros in z < 1 so that
P ˜ z / P z z = 1 sup θ 0 , 2 π j = m 1 m p ˜ j cos j θ + i sin j θ j = 0 n p j cos j θ + i sin j θ < 1
for which a sufficient condition is j = m 1 m p ˜ j / p i j i n p j < 1 for any i n ¯ . □
Note that if p 0 = 0 , Theorem 1 holds trivially since P z = z P 1 z , where P 1 z = j = 1 n p j z j , has a zero z = 0 in z 1 and the result applies directly to P 1 z = j = 1 n p j z j . By generalizing the above idea, Theorem 1 is applicable with direct “ad hoc” modifications to any polynomial P z = z p P p z with p i = 0 ; i p 1 ¯ 0 , P p z = j = p n p j z j , and 0 p < n .
An extended result from Theorem 1 under weaker constraints and also for guaranteeing the zeros to be in an annulus follows below:
Theorem 2. 
Consider the polynomials  P z ,  P ˜ z , and  Q z  of Theorem 1 under the weaker constraints  p j p j 1 ;  j n ¯  than the WPOc. Let  ρ  be defined as  ρ = p n p 0 + p 0 / p n . Then, the following properties hold:
(i) 
For any given real  ε > 0 , all the zeros of the polynomial  Q z = P z + P ˜ ( z )  are in  z < ρ + ε  provided that
sup θ 0 , 2 π j = m 1 m ρ + ε j p ˜ j cos j θ + i sin j θ j = 0 n ρ + ε j p j cos j θ + i sin j θ < 1
and a sufficient condition for (4) to hold is  j = m 1 m p ˜ j / p i j i = 0 n p j < ρ + ε m  for any  i n ¯ .
If, in addition,  P z 0  for  z = ρ , then the two above conditions also hold with  ε = 0 .
(ii) 
Assume, in addition, that  P z  has no zeros in  R P = z C : z = R 1 z = R 2 , where
R 2 = c 2 1 p n 1 M 2 + c 2 4 1 p n 1 M 2 2 + M 2 p n 1 / 2
R 1 = 1 2 M 1 2 R 2 2 b M 1 p 0 + R 2 4 b 2 M 1 p 0 2 + 4 p 0 R 2 2 M 1 3 1 / 2
M 2 = ρ p n = p n p 0 + p 0 ;   M 1 = R 2 n p n R 2 + p n p 0
c = p n p n 1 ;   b = p 1 p 0
where  0 R 2 1 ;  1 R 1 p n p 0 + p 0 / p n . Then,  P z  has its zeros in the open annulus  R 1 < z < R 2 . If (4) holds for  ε = 0 , or if its associate next sufficient condition for that holds with  ε = 0 , then  Q z  also has its zeros in  R 1 < z < R 2 .
Proof. 
It follows that, if p j p j 1 ; j n ¯ , then P z has its zeros in z ρ from an extended Eneström–Kakeya theorem in [2], so that they also lie in z < ρ + ε , [2], and if (1) or the next sufficiency-type condition holds then Q z also has all its zeros in z < ρ + ε from Rouché’s theorem. If, furthermore, P z 0 for z = ρ , then P z has its zeros in z < ρ so that Q z has also its zeros in z < ρ if (9) holds with ε = 0 . Property (i) has been proved. From an extended Eneström–Kakeya theorem provided in [2], P z has its zeros in R 1 z R 2 in the general case so that, if in addition, P z 0 for z R P , then R 1 < z < R 2 . If, furthermore, (10)–(13) hold for ε = 0 , or if its associate next sufficient condition for that holds with ε = 0 , then Q z also has its zeros in R 1 < z < R 2 . □
The subsequent result gives the relations between the first and the last polynomial coefficients to establish the sufficient conditions of the complex region where the zeros of the polynomial belong, under the decreasing order constraint of their moduli:
Corollary 1. 
In Theorem 2,  ρ = p n p 0 + p 0 / p n 1 , 1 under the constraints  p j p j 1 ;  j n ¯  of Theorem 2 if and only if  p n / p 0 1 sgn p 0 / 1 sgn p n . Then,  P z  is  WS ρ S  and  WS 1 S . Also,  ρ < 1  if and only if  p n / p 0 > 1 sgn p 0 / 1 sgn p n . Then,  P z  is  SS 1 S .
Proof. 
The proof is direct by taking into account that
p n / p 0 1 sgn p 0 / 1 sgn p n ρ 1
p n / p 0 > 1 sgn p 0 / 1 sgn p n ρ < 1
Example 1. 
Under the conditions of Corollary 1, one has the following:
(a)
If  sgn p n = sgn p 0 = 1 , then  ρ 1  if and only if  p n = p n p 0 = p 0  from the coefficient constraints and  p n / p 0 1 sgn p 0 / 1 sgn p n = 2  which is equivalent to  p n 2 p 0 < 0 . For instance, if  n = 1 , then  P z = p 1 z p 0 = p 1 z + p 0  has a zero  1 z = p 0 / 2 p 0 = 1 / 2 < 0  with  z = 1 / 2 1 . If the coefficients inequality is strict, that is,  p 1 < 2 p 0 < 0 , then  1 < z = p 0 / p 1 = 1 / 2 < 0  and  z = 1 / 2 < 1 . P z  is  WS 1 / 2 S  and  SS 1 S .
(b)
If  sgn p n = 1 ;  sgn p 0 = 1 , then  p n = p n p 0 = 2 p 0 > 0 . For instance, if  P z = p 1 z + p 0  has a zero,  1 z = p 0 / p 1 = p 0 / p 1 1 sgn p 0 / 1 sgn p n = 0 / 2 = 0 . If the coefficients inequality is strict, that is,  p 1 = p 1 > p 0 > 1 sgn p 0 / 1 sgn p n = 0 / 2 = 0 , then  1 > z = p 0 / p 1 = p 0 / p 1 > 0 .
(c)
If  sgn p n = sgn p 0 = 1 , then  p n = p n p 0 = p 0 > 0  from the coefficients constraint. However, the corollary constraint  p n / p 0 1 sgn p 0 / 1 sgn p n = 2 / 0 =  fails and this case is not covered by the corollary.
(d)
If  sgn p n = sgn p 0 = 1 , then  p n = p n p 0 = p 0 > 0  from the constraint on the coefficients. However, the corollary constraint  p n 1 sgn p n p 0 1 sgn p 0  gives  z ρ = 1  and this case guarantees only weak 1-Schur stability from the corollary but not strong 1-Schur stability since  ρ = p n p 0 + p 0 / p n = 1 .
Theorem 1 can be extended as follows by relaxing the monotonicity condition on the coefficients:
Theorem 3. 
Consider two polynomials  P z = j = 0 n t j p j z j  and  P ˜ z = j = m 1 m p ˜ j z j  of real coefficients and respective degrees  n 1  and  m  with  n m m 1 1 . Then, the following properties hold:
(i) 
Assume that for some nonzero real constant  t ,  p j t 1 p j 1 0 ;  j n ¯ . Then, all the zeros of  P z  lie in  z 1 . For any given real  ε > 0 , all the zeros of the polynomial  Q z = P z + P ˜ ( z )  are in  z < 1 + ε  provided that
sup θ 0 , 2 π j = m 1 m 1 + ε j p ˜ j cos j θ + i sin j θ j = 0 n 1 + ε j t j p j cos j θ + i sin j θ < 1
and a sufficient condition for (9) to hold is  j = m 1 m p ˜ j / t i p i j i = 0 n t j p j < 1 + ε m  for any  i n ¯ .
(ii) 
Define the polynomial  P t z = j = 0 n p j t z j , which gives the same value as  P z  for each  z C , subject to  p j p j 1 0 ;  j n ¯  with  p 0 > 0 . Then all the zeros of  P z  lie in  z t 1  so that  P t z  is  SS 1 S  if  t > 1 . Define the polynomial  P ˜ t z = j = m 1 m p ˜ j t z j . Then,  Q t z = P t z + P ˜ ( t z )  has all its zeros in  z t 1  if
sup θ 0 , 2 π j = m 1 m t j p ˜ j cos j θ + i sin j θ j = 0 n t j p j cos j θ + i sin j θ < 1
and a sufficient condition for (17) to hold is
j = m 1 m p ˜ j / p i j i = 0 n p j < min 1 , t n max t m 1 , t m .
for any  i n ¯ .
Proof. 
The first part of Property (i) follows from Eneström–Kakeya theorem as in Theorem 1. The second part follows from the Rouché theorem on zeros. □
In a very similar way as for addressing the above result, we can now obtain an extended version of the Eneström–Kakeya theorem of the original polynomial to guarantee when the zeros lie within closed circles of the complex plane centred at zero.
If a weighted sequence with a powered arbitrary nonzero weight sequence of the polynomial coefficients of the highest to the lowest power is non-increasing, then the zeros are in an open circle of radius defined by the weight. This idea is addressed in the next result:
Theorem 4. 
Consider the polynomials  P z = j = 0 n p j z j  of degree  n 1  with real coefficients. If  p j t 1 p j 1 0 ;  j n ¯  for any given real constant  t > 0 , then all the zeros of  P z  lie in  z t 1 .
Consider the polynomial Q z = P z + P ˜ z , where P ˜ z = j = m 1 m p ˜ j z j has a degree m such that n m m 1 0 . If p j t p j 1 0 ; j n ¯ for any given real constant t > 0 and, furthermore, P ˜ z P z z = t 1 + t ˜ < 1 for any arbitrary real constant t ˜ > 0 , then all the zeros of Q z lie in z t 1 + t ˜ . If t > 1 and t ˜ < 1 t 1 , then P z is SS 1 S with zeros in z t 1 < 1 and Q z is SS 1 S with zeros in z t 1 + t ˜ < 1 .
Proof. 
Note that for any positive real constant t
P z = j = 0 n p j t n j t n t z j
Then, P z = P t z = j = 0 n p j t z j where p j = p j t n j t n . From the Eneström–Kakeya-theorem, and since p j p j 1 0 ; j n ¯ is equivalent to p j t p j 1 0 ; j n ¯ , this last condition implies that the zeros of P t z , and also those of P z , lie in z t 1 . This proves the first part of the theorem. On the other hand, note that the zeros of P z also lie in the open circle z < t 1 + t ˜ centred at zero for any t ˜ > 0 . Then, if P ˜ z P z z = t 1 + t ˜ < 1 , then the zeros of Q z lie in z t 1 + t ˜ from the Rouché theorem on zeros. As a result, if t > 1 and t ˜ < 1 t 1 with zeros in z t 1 < 1 , Q z is SS 1 S with zeros in z t 1 + t ˜ < 1 . □
Remark 3. 
Theorem 4 can be used to check the stability of polynomials which can be stable but do not fulfil the decreasing ordering of the polynomial coefficients in order to apply the Eneström–Kakeya theorem. Assume that the polynomial Q z  does not meet the decreasing ordering coefficient constraints to apply such a theorem but a polynomial  P z = j = 0 n p j z j  which is  WS t 1 S , then  WS t 1 + ε S  for any real  ε 0  fulfils them while  P ˜ z = Q z P z  fulfils  P ˜ z P z z = t 1 + ε < 1 . Thus,  Q z  is  W S t 1 + ε S  too (and also  SS t 1 + ε S  is stable as a result) according to the Rouché theorem of zeros.
Example 2. 
The polynomial  Q z = z 2 + 1.1 z + c = 0  is  SS 1 S , and then  WS 1 S  as well, for  c 0 , 1 . Since the coefficients do not fulfil the constraint  1 1.1 c > 0 , the Eneström–Kakeya theorem cannot be applied. Now, we put  Q z = P z + P ˜ z , where  P z = p 2 z 2 + p 1 z + a 0  with  p i = t i ;  i = 1 , 2  and  p 0 = c  for some given real  t > 1 . Thus,  p 2 > p 1 > p 0 > 0  which is  SS t S  according to Eneström–Kakeya theorem, and
P ˜ z = Q z P z = 1 t 2 z 2 + 1 t z = 1 t z 1 + t z + 1
so that
P ˜ z P z z = t 1 = 1 t z 1 + t z + 1 t 2 z 2 + t z + 1 z = t 1 < 1
By taking  t = 1.1 , one obtains  P ˜ z P z z = t 1 = 1 t z 1 + t z + 1 t 2 z 2 + t z + 1 z = t 1 0.27 < 1  and one concludes that  Q z  is  SS t 1 S  for  t > 1  so that it is  SS 1 S  as well, as it follows from Lemma 1.
Theorem 5. 
Consider the polynomials  P z = z n + j = 0 n 1 p j z j  of degree  n 1  with complex coefficients and  j = 0 n 1 p j z j  not being identically null for all  z C ,  P ˜ z = j = 0 n 1 p j + p j z j , and  Q z = P z + P ˜ z  of Theorem 1 under the weaker constraints  p j p j 1 ;  j n 1 ¯ 0  of Theorem 2. Then,  P z  has just one zero in  C +  provided that  P ˜ z / P ( z ) z = i ω , ω R 0 + < 1 .
Proof. 
Note that
Q z = P z + P ˜ z = z n j = 0 n 1 p j z j
has a unique positive real root p from a classical Cauchy’s theorem, [8], and, furthermore, all the zeros of P z have the following property:
Z P z B ¯ p B 1 + p ¯
with p ¯ = max 11 n 1 p i where B r = z : z < r and B ¯ r = z : z r are open and closed balls in R . Take the open right-hand-side complex plane C + = z C : Re z > 0 . From the above reasoning, Q z only has a root in C + which is p . Thus, from Rouché theorem P z = Q z P ˜ z , only has a root in C + if P ˜ z / P ( z ) z C + < 1 with the boundary of C + being C + = i ω : ω R 0 + z C + : z . Since deg P ˜ z n 1 < deg P z = n , then P ˜ z / P ( z ) z = 0 < 1 so that it suffices to check the conditions for P ˜ z / P ( z ) z = i ω : ω R 0 + < 1 to guarantee that P z has only one zero, as Q z has, in C + . □

2.3. Extended Results from Theorem B and Rouché’s Theorem

It has been seen that the standard (strong) Schur stability, that is, strong 1-Schur stability of a polynomial consists of all its zeros lying in z < 1 (see Definition 2 and Remark 1). However, the Eneström–Kakeya theorem (Theorem A) only gives sufficient conditions for the polynomial to be WS 1 S . A combination of Theorem B with the Rouché theorem now gives sufficient conditions for the polynomial to be SS 1 S as follows:
Theorem 6. 
Let polynomials  P z = j = 0 n p j z j = P * z + P z P * z  and  P * z = j = 0 m p j * z j  be of real coefficients and respective degrees  n m  with  n 1  and  m 0 , where  p j * > p j 1 * > 0 ;  j n ¯ . Then, the following properties hold:
(i) 
If  1 P z / P * z z = 1 < 1 , then  P z  is  SS 1 S  and WS  max j n ¯ p j 1 / p j < 1 . The sufficiency-type constraint  1 P z / P * z z = 1 < 1  is equivalent to  2 > j = 0 n p j e i j θ / j = 0 m p j * e i j θ θ 0 , 2 π > 0 .
(ii) 
Assume that  n = m  and  p j = ρ j p j * , with  ρ j ρ ¯ , ρ ¯  for  j n ¯ 0 . Then, the property (i) holds if  ρ ¯ > 0  and  ρ ¯ < 2 .
Proof. 
Note m = n q for some 0 q n if and only if p j = p j * > p j 1 * > 0 for j = n q + 1 , n q + 2 , , n 1 , n and p n q p n q * . It turns out that P * z is SS 1 S (and also WS max j n ¯ p j 1 / p j < 1 (1)S) from Theorem B. As a result, P z is guaranteed to be SS(1)S provided that 1 P z / P * z z = 1 < 1 , equivalently 0 < P e i θ / P * e i θ θ 0 , 2 π < 2 , since then all the zeros of P z lie in z max j n ¯ p j 1 / p j < 1 from the Rouché theorem. Property (i) has been proved. If m = m and p j = ρ j p j * for j n ¯ 0 , then
0 < P e i θ P * e i θ θ 0 , 2 π = j = 0 n ρ j p j * e i j θ j = 0 n p j * e i j θ θ 0 , 2 π < 2
holds if
0 < ρ ¯ = ρ ¯ j = 0 n p j * e i j θ j = 0 n p j * e i j θ θ 0 , 2 π j = 0 n ρ j p j * e i j θ j = 0 n p j * e i j θ θ 0 , 2 π ρ ¯ j = 0 n p j * e i j θ j = 0 n p j * e i j θ θ 0 , 2 π = ρ ¯ < 2
and Property (ii) follows. □
Remark 4. 
Define the polynomial  q n l t z = k = 0 n l a k t z k  of degree  n l > 0  defined for any given positive real constant  t  with real coefficients satisfying the WPOc with  a 0 > 0  of the reciprocal polynomial  q n l * t z = t z m l q m l t z 1 . Then, all the zeros of the subsequent polynomial are as follows:
p n t z = t z l q n l t z + e i θ q n l * t z
for any given integer  l  and any real  θ  lie on  z = t 1 .
Proof. 
Since a n ε a n l 1 a 0 > 0 , all the zeros of q n l t z lie in z t 1 . □

2.4. Results for the Polynomial Coefficients in Known Intervals

The generalization of the Eneström–Kakeya theorem and its extensions to the case when the coefficients (or their moduli) belong to known intervals while the known coefficients are unknown is of interest. Some of the above theorems might be extended, supported by the Rouché theorem, provided that the coefficient ordered sequences hold for coefficients (or their moduli) within the ranges of variation which are not necessarily the current coefficients (or their modulus).
Theorem 7. 
Consider a polynomial  P z = j = 0 n p j z j  of real coefficients and degree  n 1  such that  p j p ¯ j , p ¯ j , such that  p ¯ j 0  and  p ¯ j < + ;  j n ¯ . Assume that  p j * p j 1 * ;  j n ¯ , where  p j * p ¯ j , p ¯ j ;  j n ¯ 0 . Then,  P z  has all its zeros in  z 1  if any of the subsequent conditions given from the weaker one to the stronger one hold:
1 j = 0 n p j z j j = 0 n p j * z j z = 1 < 1
max 0 j n p ¯ j p ¯ j < 1 n + 1 j = 0 n 1 p j * z j z = 1
max 0 j n p ¯ j p ¯ j < 1 n + 1 p n * j = 0 n 1 p j *
Proof. 
Note that
P z = P * z + P z P * z
where P * z = j = 0 n p j * z j and p j p j * p ¯ j p ¯ j ; j n ¯ 0 . Since p j * p j 1 * 0 for j n ¯ and since p ¯ j 0 for j n ¯ 0 , one has from Eneström–Kakeya theorem that all the zeros of P * z lie in z 1 . Now, one concludes from the Rouché theorem that all the zeros of P z lie in z 1 as well if (27) holds
P z P * z P * z z = 1 = j = 0 n p j p j * z j j = 0 n p j * z j z = 1 = 1 j = 0 n p j z j j = 0 n p j * z j z = 1 < 1
For the above condition to hold, and since p j p j * p ¯ j p ¯ j ; j n ¯ 0 , it suffices that (28) holds. And, for (28) to hold, it suffices that (29) holds since p n * p j * for j n ¯ 0 , and
j = 0 n p j * z j z = 1 p n * z n z = 1 j = 0 n 1 p j * z j z = 1 p n * j = 0 n 1 p j * z j
j = 0 n p ¯ j p ¯ j z j j = 0 n p j * z j z = 1 < 1
and, furthermore, for the last condition to hold, it suffices that
max 0 j n p ¯ j p ¯ j < 1 n + 1 j = 0 n 1 p j * z j z = 1
or that
max 0 j n p ¯ j p ¯ j < 1 n + 1 p n * j = 0 n 1 p j *
Corollary 2. 
Theorem 7 holds if  P * z = P ¯ z = j = 0 n p ¯ j z j  or if  P * z = P ¯ z = j = 0 n p ¯ j z j .

2.5. Some Simple Examples Linked to Control Theory

Three examples related to control theory problems follow below:
Example 3 
(linear discrete time-invariant dynamic system). Consider a single-input single-output (SISO) linear discrete dynamic system of dimension n described by the state-space controllability form
x k + 1 = A x k + b u k ,   y k = x 1 k ;   x 0 = x 0
where  x k k = 0 R n  is the state vector,  y k k = 0 R  and  u k k = 0 R  are the scalar output and input sequences; and  A R n × n  and  b R n  are as follows:
A 0 = 0 1 0 0 0 0 1 0 0 0 0 1 a 0 a 1 a 2 a n 1 ;   b = 0 0 0 1
The above description is a state-space description of the open-loop (that is, control-free) difference equation  y k + n = i = 1 n a n i y k + n i  for  k Z 0 + , under an identically zero control sequence, subject to any set of initial conditions  y 0 , y 1 , , y n 1 T = x 0 . The characteristic polynomial of  A  is  p 0 z = z n + i = 1 n a n i z n i . The above discrete system is controllable, (or, in short, the pair  A 0 , b  is controllable), that is,  r a n k b , A 0 b , , A 0 n 1 b = n  [18,19]. Now, assume that the control sequence is generated through the linear difference equation  u k + n = i = 1 n k n i u k + n i , where  k i R  for  i n 1 ¯ 0  are the controller gains, which combined with the above open-loop control difference equation yields the closed loop (that is, subject to linear feedback control)
y k + n = i = 1 n k n i a n i y k + n i
whose characteristic polynomial is  p c z = z n + i = 1 n a n i k n i z n i  and the associated matrix of dynamics of the closed-loop difference system becomes
A c = 0 1 0 0 0 0 1 0 0 0 0 1 k 0 a 0 k 1 a 1 k 2 a 2 k n 1 a n 1
Since  A 0 , b  is controllable, then the spectrum is freely assignable to any prescribed positions in the complex plane by the controller gains. Note that  s p A c = z C : p c z = 0 . Without calculating the zeros of  p c z , we can apply Theorem B to conclude that, if  k n i < a n i a n i 1 + k n i 1  for  i n ¯  and  k n = 0 < a n = 1 a n 1 + k n 1 , equivalently  k n 1 > a n 1 1 , subject to the initialization  k 1 = a 1 = 0 ; then,  a n i k n i i = 1 n  is positive and strictly decreasing, that is, the  S P O c  property is satisfied. Then, all the zeros of  p c z  lie in  z ρ c = max i n 1 ¯ 0 a i 1 k i 1 a i k i < 1  and the discrete linear dynamic closed-loop system is  WS ρ c S  and then  SS 1 S  as a result. This closed-loop stabilization is achievable by the choice of the control gains even if, in the control-free case,  ρ 0 = max i n 1 ¯ 0 a i 1 a i 1  so that the open-loop system is not  SS 1 S .
If the decreasing condition for the coefficients is not strict although they are non-negative, that is,  k n i a n i a n i 1 + k n i 1  for  i n ¯  together with  k n 1 a n 1 1 , then all the zeros of  p c z  lie in  z 1  from Theorem A and then the discrete linear dynamic system is only guaranteed to be  W S ( 1 ) S .
Example 4 
(discretized transfer function under a zero-order hold). The ordering conditions WPOc and SPOc can also be invoked for investigating the stability properties of continuous-time linear systems derived from their discretized counterparts. Consider a single-input single-output (SISO) linear continuous dynamic system of dimension n whose transfer function, that is, the Laplace quotient transforms Y s = L y t of the output “y(t)” to that input “u(t)”, with U s = L u t under zero initial conditions, is G s = L y t / L u t = B s / A s , where A s = i = 0 n a i s i and B s = i = 0 m b i s i are polynomials of real coefficients in the Laplace argument “s” of respective degrees n 1 and m n . Since the Laplace transform argument and the time derivative operator D = d / d t are formally equivalent, the transfer function represents the ordinary differential equation A D y t = B D u t of order n whose solution y : R 0 + R is unique for any given set of finite initial conditions y i 0 = D i y t t = 0 for i n 1 ¯ 0 , with D i = D i 1 D and D 0 = 1 , and for any given piecewise constant input u : R 0 + R . If u t = u k T = u k , t k T , k + 1 T for any given sampling period T > 0 ; then, the discrete-transfer function G z in the argument “z”, with z = e T s is the quotient of the Laplace transforms of the output y t to the above piecewise constant input with finite discontinuities at the sampling instants k T , k Z 0 + . The discretization device transforms a sequence u k k = 0 into a piecewise constant function. u : R 0 + R defined by
u t = u k T = u k = j = 1 n t u j T 1 j T 1 j 1 T ;   t k T , k + 1 T ,   n t = max z Z 0 + : z t
where  1 t  is the Heaviside step function, referred to as a sampling and zero-order hold device (ZOH) whose transfer function is  G 0 T s = 1 e T s / s . Thus, we have
G z = Z y t / Z u t = Z 1 e T s G s / s = 1 z 1 Z G s / s
Assume that  A 0 0 , that is,  G s  has no integrators, and note that there is a unique polynomial  B s = i = 0 m b i s i  of degree  m = n 1  such that
G s s = B s s A s = a s + B s A s = a A s + s B s s A s = i = 0 n a a i s i + i = 0 n 1 b i s i + 1 i = 0 n + 1 a i s i + 1 = i = 0 m b i s i i = 0 n + 1 a i s i + 1
with
a = b 0 / a 0 b 0 = b 1 a a 1 = b 1 b 0 a 1 / a 0 b 1 = b 2 a a 2 = b 2 b 0 a 2 / a 0
b m 1 = b m b 0 a m / a 0 b m = b m + 1 b 0 a m + 1 / a 0 = b 0 a m + 1 / a 0
b n 1 = b n b 0 a n / a 0 = b 0 a n / a 0
Define the auxiliary transfer function  G s = B s / A s . Then, by the linearity of the  z -transform,
G z = Q z P z = z 1 z a Z 1 s + Z G s = a + z 1 z G z
Thus, the poles of  G z , which are the zeros of the polynomial  P z , are  z i = e s i T ;  i n ¯  (since  G s  and  G s  have the same denominator polynomial  A s , which is repeated in the case that the respective multiplicities are greater than one. The poles of  G z  are the above plus an additional one at  z = 0 . This null pole can also be interpreted as a numerator factor  z 1  of the discrete-transfer function which supplies a one-sample delay of the output sequence with respect to the input sequence. Therefore, all the above results based on the ordering conditions WPOc and/or SPOc of the polynomial coefficients being applicable to  P z  conclude that its weak and/or strong Schur stability properties lead to the critical or Hurwitz stability of the polynomial  A s  and, thus, to the corresponding stability properties of the continuous-transfer function which has been discretized through the ZOH.
If the input is the sequence  u k k = 0 , instead the above piecewise constant function, that is, a ZOH is not involved then the resulting discrete-transfer function is  G d z = Z G s  and its poles are the zeros of the polynomial  P d z  which are those of  P z  except  z = 0  derived from the discretization process itself through the ZOH. Therefore, the above recalled or established results based on the ordering conditions WPOc and/or SPOc of the polynomial coefficients still apply to conclude that some degree of Schur stability of the denominator polynomials of the discrete-transfer function translate in a corresponding stability property of the denominator of the continuous-transfer function.
Finally, it has to be pointed out that (a) the used notation of the z-transforms of the continuous-transfer function is commonly used in the literature but it is an abuse of notation since z-transforms are Laplace transforms of time sequences, rather than transforms of Laplace transforms; (b) if some kind of sampling and hold device, such as the mentioned zero-order one or another one of higher order, is removed from the discretization process, as proposed in the last part of this example, then the resulting discrete-transfer function is not useful in many applications since the sampled input sequence does not supply the necessary power [19].
Example 5 
(root locus). The root locus is a popular analysis of stability of the closed-loop system in both linear time-invariant continuous-time and discrete-time systems. To fix the ideas, consider a discrete-transfer function G z = B z / A ( z ) , where B z and A z are polynomials with deg B z deg A z . Assume that such a transfer function is controlled under a constant feed-forward controller of scalar gain K > 0 and unity negative feedback. Thus, the closed-loop transfer function becomes F f f z = K B z / A z + K B z . If the same constant controller is a feedback controller under negative feedback then the closed-loop transfer function is F f b z = B z / A z + K B z . In both cases, the closed-loop poles are the zeros of the denominator polynomial P K z = A z + K B z . The so-called root locus, [18], is the curve in the complex plane which allocates the position of those zeros as K ranges from K = 0 to K = + so that the zeros of P K z are arbitrarily close to those of A z as K 0 and arbitrarily close to those of B z as K + . As a result of the continuity of the locus as a function of K , if both B z and A z are SS(1)S then there exist K 1 , K 2 K 1 , + 0 , + such that P K z is SS(1)S for K 0 , K 1 K 2 , + since all its zeros are in z < 1 and the closed-loop transfer functions F f f z and F f b z are then stable. Such a conclusion does not guarantee that P K z is SS(1)S, and then the closed-loop transfer functions F f f z and F f b z are then stable, for K 0 , + .
Now, note that
P K z = i = 0 n a i z i + i = 0 n K b i z i = i = 0 n a i + K b i z i
Assume that  a i + K b i > 0 ;  i n ¯ 0  and that there exists a real constant  t  satisfying
1 > t sup K 0 , + max i n ¯ a i 1 + K b i 1 / a i + K b i
Then, from Theorem 3(i),  P k z  is SS(1)S and SS(t)S with zeros in  z t < 1 , and the closed-loop transfer functions  F f f z  and  F f b z  are then stable, for  K 0 , + . As expected, the necessary conditions from (45) to hold are the fulfilment for  K = 0  and  K = +  so that (45) implies that
1 > t max max i n ¯ a i 1 / a i , max b i 1 / b i
with the closed-loop transfer functions  F f f z  and  F f b z  then being stable, for  K 0 , + . Condition (45) is relaxed to a weaker one, which is simpler to test, if  a i > 0 ,  b i > 0 ;  i n ¯ 0  and there exists  t , subject to  1 > t max max i n ¯ a i 1 / a i , max b i 1 / b i , since then for  K 0 , + , one has from (46) that
t a i + K b i = t a i + t K b i a i 1 + K b i 1
Note that  45  implies  46  as a necessary condition and, conversely, (46) implies (45), since (47) holds for the whole scalar controller range of positive real gains  K 0 , + . Thus, the closed-loop transfer functions  F f f z  and  F f b z  are stable with poles in  z t < 1 , for  K 0 , +  if (46) holds with  a i > 0 ,  b i > 0 ;  i n ¯ 0 . If (46) is modified as follows,
1 t > max max i n ¯ a i 1 / a i , max b i 1 / b i
then the closed-loop transfer functions  F f f z  and  F f b z  are stable with poles in  z < t 1 , for  K 0 , + .
Now, assume that  A z  and  B z  are perturbed as follows  A z A z + A ˜ z = 1 + λ A z A z  and  B z B z + B ˜ z = 1 + λ B z B z  and define  λ = max sup 0 t ˜ 1 t sup z = t + t ˜ λ A z , sup 0 t ˜ 1 t sup z = t + t ˜ λ B z . If  λ < 1 , then
P ˜ K z P K z = A ˜ z + K B ˜ z A z + K B z λ < 1 ; z 1
so that all the zeros of  P K z + P ˜ k z = 1 + λ A z A z + 1 + λ B z B z  are in  z < 1  for  K 0 , +  from the Rouché theorem (Theorem 3(ii)) since those of  P z  are in  z t < 1  for  K 0 , +  (Theorem 3(i)).

2.6. A Result by Using a Previous Cauchy’s Theorem on Bounds of Zeros

The subsequent elementary result is supported by a celebrated theorem of Cauchy on the upper-bounds of the zeros of a polynomial of complex coefficients, combined with the Rouché theorem of zeros. It neither involves any ordering condition on the real and imaginary parts of the coefficients of the polynomial nor on their moduli.
Theorem 8. 
Consider the polynomials  P z = z n + j = 0 n 1 p j z j  of degree  n 1  with complex coefficients, such that  j = 0 n 1 p j z j  is not identically null for all  z C ,  P ˜ z = j = 0 n 1 p j + p j z j  and  Q z = P z + P ˜ z  of Theorem 1 under the constraint  sup θ 0 , 2 π n η θ / d η θ < 1 , where
n η θ = 2 j p o s c o P p j η j cos j θ 2 + j p o s c o P p j η j sin j θ 2
d η θ = η n cos n θ + j p o s c o P p j η j cos j θ j n e g c o P p j η j cos j θ 2 + η n sin n θ + j p o s c o P p j η j sin j θ j n e g c o P p j η j sin j θ 2
where
p o s c o P = j n 1 ¯ 0 : p j R + ;   n e g c o P = j n 1 ¯ 0 : p j R
Then, all the zeros of  P z  are in  z η .
Also, all the zeros of  P z  are in  z < η ¯ = 1 + max i n 1 ¯ 0 p i , under the weaker condition  sup θ 0 , 2 π n η θ / d η θ < 1 .
Proof. 
From the classical Cauchy’s theorem [8], it is well-known that if η is the unique positive zero of Q z = z n j = 0 n 1 p j z j then all the zeros of P z lie in the closed ball B ¯ η centred at z = 0 which in turn is contained in the open ball B 1 + a centred at z = 0 , where a = max i n 1 ¯ 0 p i . Thus, all the zeros of Q z are in z < η η ¯ = 1 + m a x i n 1 ¯ 0 p i . Note that p j > 0 p j + p j = 2 p j and p j < 0 p j + p j = 0 . Then, from the Rouché theorem, P z has all its zeros in z < η if
P ˜ z P z z = η sup θ 0 , 2 π n θ d θ < 1
which proves the result. □

2.7. A Result for Alternating Signs of Coefficients and Further Related Results

It is of interest to consider the case when the positivity and negativity of the real coefficients alternate on different adjacent sequences of powers of z , in general, of distinct sizes and at the same time keep the alternate increasing/decreasing ordering sequences of consecutive coefficients. In that context, we state the subsequent result:
Theorem 9. 
Consider the polynomial  P z = j = 0 n p j z j  which has real coefficients and degree  n , i.e.,  p n 0  so that  deg P z = n . Assume that there exist integers  n 1 = 0 , n 2 , , n m + 1 = n ,  m 1 , m 2 , , m m  satisfying the following constraints:
n m + 1 = n = i = 1 m m i = i = 1 m n i + 1 n i n 1 = 0
m i = n i + 1 n i 2
and define, in general, non-connected disjoint sets of integers which contain the powers of the argument  z  according to the decreasing rules of the coefficients of  P z  as follows:
S 1 = i n ¯ 0 : p i , j + 1 > p i j > 0 , j n i , n i + 1 1
S 2 = i n ¯ 0 : p i , j + 1 < p i j < 0 , j n i , n i + 1 1
such that  S 1  and  S 2  can be expressed as disjoint unions of their respective connected components as follows:
S 1 = i q ¯ 1 S 1 i ,   S 2 = i q ¯ 2 S 2 i ;   m = q 1 + q 2   and   n = c a r d S 1 + c a r d S 2
so that the coefficients of each connected component of  S 1  (respectively, of those of  S 2 ) are followed in decreasing order of powers of  z  by those of  S 2  (respectively, of those of  S 1 ) until the set of coefficients ends with  p 0 . Assume that each absolute value of the leading coefficient of one connected component of  S 1  or, respectively,  S 2  is larger than the last coefficient of the preceding connected component of  S 2  or, respectively,  S 1 , that is,  p i + 1 , n i + 2 > p i n i .
Note that the sets of coefficients verify the notation equality
p 0 , p 1 , , p n = p 00 , p 10 , p 1 n 2 , p 2 n 2 + 1 , , p 2 n 3 , , p m n m + 1
In view of the above relations, we have that  P z  can be rewritten equivalently as follows:
P z = i = 1 m j = n i n i + 1 p i j z j = i S 1 j = n i n i + 1 p i j z j i S 2 j = n i n i + 1 p i j z j = i S 1 j = n i n i + 1 p i j z j + i S 2 j = n i n i + 1 p i j z j 2 i S 2 j = n i n i + 1 p i j z j = P * z 2 P ˜ z = j = 0 n p j z j 2 i S 2 j = n i n i + 1 p i j z j
Note that  P * z = j = 0 n p j z j , defined with the absolute values of the coefficients of  P z , has all its zeros in  z < 1  from Theorem B. From the Rouché theorem, the zeros of  P z  lie in  z < 1  if, furthermore,
P ˜ z P * z z = 1 = i S 2 j = n i n i + 1 p i j z j j = 1 n p j z j z = 1 < 1 2
If the coefficients of  P ˜ z  are expressed as  p . = ε p . r  with respect to a reference polynomial  P ˜ r z  of the same degree, so that  P ˜ z = ε P ˜ r z  for some real constant  ε 0 , ε ¯ , then the above condition holds if
ε ¯ < 1 2 inf z = 1 P * z P ˜ z = inf z = 1 P * z P * z P z = 1 2 inf z = 1 j = 0 n p j z j i S 2 j = n i n i + 1 p i j r z j
and the proof is complete since  P z  is SS(1)S.
The above result is now directly extended to a polynomial Q z which satisfies the conditions of P z in the above theorem but is affected by an unstructured (in the sense that it does not fulfil ordering conditions on its coefficients) additive polynomial.
Corollary 3. 
Assume that  Q z = P z Δ z  where  P z  is the polynomial of Theorem 9 and  Δ z  is a polynomial with  deg Δ z deg P z = n . Then, the zeros of  Q z  lie in  z < 1 , and then  Q z  is SS(1)S, if
inf z = 1 P * z 2 P ˜ z + Δ z < 1
Corollary 4. 
Assume that the ordering conditions of coefficients in Theorem 9 are modified accordingly to the following redefinitions of the sets S 1 and  S 2  for some given real constant  t R + :
S 1 t = i n ¯ 0 : p i , j + 1 > t p i j > 0 , j n i , n i + 1 1
S 2 t = i n ¯ 0 : p i , j + 1 < t p i j < 0 , j n i , n i + 1 1
and that  p i + 1 , n i + 2 > t p i n i  when linking adjacent components of powers of the complex argument z. Then, the zeros of  P z  lie in  z < t 1 , and  P z  is SS  t 1  S, if  ε 0 , ε ¯ t  such that
ε ¯ t < 1 2 inf z = t 1 P * z P ˜ z = 1 2 inf z = t 1 j = 0 n p j z j i S 2 j = n i n i + 1 p i j r z j
If  t 1  then  P z  is SS  t 1  S as well.
Corollary 5. 
Assume that  Q z = P z Δ z  where  P z  is the polynomial of Theorem 9 and  Δ z  is a polynomial with  deg Δ z deg P z = n . Then, the zeros of  Q z  lie in  z < t 1 , and then  Q z  is SS(  t 1  )S, and also SS(1)S if  t 1 , for some given  t R + , if
inf z = t 1 P * z 2 P ˜ z + Δ z < 1
provided that (a) the powers of the complex argument z of the coefficients of  P z  are redefined by replacing  S i S i t  for  i = 1 , 2 ; and (b) that  p i + 1 , n i + 2 > t p i n i  when linking adjacent components of powers of coefficients.
Fast tests of the above relevant inequalities to guarantee the Rouché theorem for a tolerance to the perturbed polynomial which keeps the Schur stability property can be performed under sufficiency-type conditions by checking on real values of the complex argument z . For instance, for the Theorem 9, we have the following:
Corollary 6. 
The inequality (60) is guaranteed if
ε ¯ < 1 2 j = 0 m p 2 j j = 1 m p 2 j 1 i S 2 j = n i n i + 1 p i j r
Proof. 
Consider two cases as follows:
(a)
If n is even then n = 2 m for m Z 0 + and (60) takes the form
ε ¯ < 1 2 inf z = 1 j = 0 2 m p j z j i S 2 j = n i n i + 1 p i j r z j = 1 2 inf z = 1 j = 0 m p 2 j z 2 j + j = 1 m p 2 j 1 z 2 j 1 i S 2 j = n i n i + 1 p i j r z j
which holds, by taking a lower-bound of the above last term, if (66) holds since a lower bound of the numerator of (67) for z = 1 is reached when the two additive terms are opposed and an upper bound of the denominator for z = 1 is reached at z = 1 .
(b)
If n is odd then n = 2 m + 1 for m Z 0 + and * takes the form
ε ¯ < 1 2 inf z = 1 j = 0 2 m + 1 p j z j i S 2 j = n i n i + 1 p i j r z j = 1 2 inf z = 1 j = 0 m p 2 j z 2 j + j = 1 m p 2 j + 1 z 2 j + 1 i S 2 j = n i n i + 1 p i j r z j
which is also guaranteed if (66) holds. □

3. Some Extensions to the Allocation of the Zeros of a Class of Quasi-Polynomials Linked to Dynamic Systems with Constant Point Delays

3.1. Introductory Notes on Quasi-Polynomials and Delay Systems

Quasi-polynomials are referred to as transcendent complex equations which are very related to polynomials of several variables. A typical class of quasi-polynomials includes those of the form
Q h s = k = 0 n j = 0 m a k j s j e k h s = j = 0 m b j e h s s j = k = 0 n a k s e k h s
where h R and a k j are real or complex coefficients for k n ¯ 0 and k m ¯ 0 .
a k s = j = 0 m a k j s j ;   b j e h s = k = 0 n a k j e k h s
Note that Q h s is a transcendent function in a complex variable “ s ”, but it depends jointly on s and e h s (and on a finite number of their powers) as mutually dependent arguments and, for that reason, Q h s is not a polynomial of two complex variables but a quasi-polynomial.
However, Q h s can be represented by a two-variable polynomial P s , z 1 with the identification of z 1 = z 1 s with e h s . Since z 1 depends on s then the zeros of P s , z 1 are zeros of Q h s if and only if z = e h s , that is s = h ln z , if h 0 , and s = 0 if z = 1 , that is, if P 0 , 1 = 0 then Q h 0 = 0 . In other words, if s 0 , z 0 = 0 , 1 is a zero of P s , z 1 then s 0 = 0 is a zero of Q s but if 0 , z 0 is a zero of P s , z 1 for some z 0 1 then Q h 0 0 , namely, s 0 = 0 is not a zero of Q h s . And also, if h 0 and s 0 , z 0 1 is a zero of P s , z 1 then s 0 is a zero of Q h s if and only if s 0 = h 1 ln z 0 . It can be pointed out that derived potential stability results for the two-variable polynomials “s” and “z” obtained with the above change are just sufficiency-type stability conditions for the original quasi-polynomials which just depend on the argument “s”. Those conditions are not, in general, necessary but they are easier to test than the necessary and sufficient ones related to the quasi-polynomials of a single argument “s” [16,17].
If h R 0 + , and a k j are real for k n ¯ 0 and k m ¯ 0 , then Q h s is the characteristic equation of a time-delay invariant dynamic system of dimension m with n commensurate point delays h k = k h for k n 0 (i.e., all delays are integer multiples of a basic delay h ) which define a differential system of m differential functional equations of first-order:
x ˙ t = k = 0 n A k x t k h
where A k R m × m so that Q h s = det s I m k = 0 n A k e k h s is the characteristic quasi-polynomial of (71), Q h s = 0 is its characteristic equation, and s is the Laplace transform argument, formally equivalent to the time-derivative operator D = d / d t . If (23) is subject to any given piecewise continuous function φ : n h , 0 R m then the solution x : n h , 0 R + R m of (71) is unique with x t = φ t ; t n h , 0 . See, for instance, [13,14]. It is well-known that a quasi-polynomial Q h s has infinitely many zeros but its number is finite within any finite band η Re s η 0 of the complex plane and that infinitely many of them are stable fulfilling Re s , see [14,15,16,17]. Therefore, if h = 0 then all the point delays are null, the initial condition is a point initial condition at t = 0 , and (71) becomes its particular delay-free version which follows:
x ˙ t = k = 0 n A k x t
In the following, a direct extension of one of the former basic Eneström–Kakeya results is given for quasi-polynomials.

3.2. Main Result of This Section

The main result of this section is now stated:
Theorem 10. 
Let  Q s = k = 0 n a k s e h k s  be a quasi-polynomial of degree  m 1  in the argument s, that is, the highest power of the polynomials  a k s  is  m , with an associated two-variable polynomial  P s , z = k = 0 n a k s z k , via the replacement  e h s z , of degrees  n 1  in the argument  z  and  m 1  in the argument  s , where  a k s = j = 0 m a k j s j  is a polynomial of degree  m  such that the coefficients  a k j  are real for  k n ¯ 0 ,  j m ¯ 0 . Then, the following properties hold:
(i) 
Assume that for any  s = γ s + i ω s C ,  0 < a 0 γ s < a 1 γ s < < a n γ s , with  a k γ s = j = 0 m a k j γ s j  for  k m ¯ 0 .
Then, all the zeros of  P γ s , z = k = 0 n a k γ s z k = k = 0 n j = 0 m a k j γ s j z k  lie in  t s = t s γ s = max k m ¯ a k 1 γ s / a k γ s = max k m ¯ j = 0 m a k 1 , j γ s j / j = 0 m a k j γ s j < 1 . As a result, one has the following:
(1)
P γ s , z  is  S S α S  for any real constant  α t , 1 , where  t = sup γ s R t s γ s ;
(2)
P s , z  is  S S β S  for any real constant  β α , 1  if, furthermore,
sup γ s R , ω s R 0 + , z = β P γ s + i ω s , z P γ s , z P γ s , z < 1
equivalently,
sup γ s R , ω s R 0 + , θ 0 , 2 π k = 0 n j = 0 m a k j γ s 2 + ω s 2 k / 2 β k e i k a r c t g ω s / γ s + θ k = 0 n j = 0 m a k j γ s j β k e i k θ < 1
so that it is  S S 1 S ;
(3)
If all the zeros of  Q s  lie in  C , then  Q s  is Hurwitz-stable;
(ii) 
Q s  is still Hurwitz-stable if  0 < a 0 γ s < a 1 γ s < < a n γ s  does not hold in some nonempty set  C v C , but  Q s 0  for any  s C v  with  Re s = γ s , provided that in (73) the supremum is taken on  γ s C \ C v , ω s R 0 + , z = β , or in (74), on  γ s C \ C v , ω s R 0 + , θ 0 , 2 π ;
(iii) 
Assume real constants  a k *  for  k n ¯ 0  satisfying the constraints  0 < a 0 * < a 1 * < < a n * . Then, all the zeros of  P s , z , for  s C , lie in  z < ρ  for some real  ρ t * , 1 , where  t * = max k m ¯ a k 1 * / a k * < 1  if
sup Re s < 0 , θ 0 , 2 π k = 0 n j = 0 m a k j s j a k * ρ k e i k θ k = 0 n a k * ρ k e i k θ < 1
and  P s , z  is  SS α S  for any real constant  α ρ , 1  so that it is  SS 1 S . Also, if all the zeros of  Q s  lie in  C , then  Q s  is Hurwitz-stable. Sufficient conditions for (75) to hold are
sup γ R sup θ 0 , 2 π k = 0 n j = 0 m a k j γ j a k * e i k θ k = 0 n a k * e i k θ < ρ n
sup γ R sup θ 0 , 2 π max k n ¯ 0 j = 0 m a k j γ j a k * e i k θ k = 0 n a k * e i k θ < ρ n n + 1
sup γ φ R φ max j φ n ¯ φ 0 max k φ n ¯ φ o j = 0 m a k j γ i - a k * a j * - k φ j = 0 n a k * = max k φ n ¯ φ o j = 0 m a k j γ i - a k * min j φ n ¯ φ o a j * - k φ j = 0 n a k * < ρ n n + 1
Proof. 
Property (i) follows from Theorem B which guarantees that, for any given γ s = Re s < 0 , P γ s , z has all its zeros in z t s < 1 since 0 < a 0 γ s < a 1 γ s < < a n γ s , t s = t s γ s . Note also that z t s < 1 implies by taking the principal part of the complex Neperian logarithm ln z that z < 1 is only possible with γ s < 0 since
ln z i θ = ln z = ln e h s = h Re s + i Im s = h γ s + i ω s ln t s < 0 + i 0 = 0 ,   some   θ 0 , 2 π
Then, by using the Rouché theorem combined with the above result, the constraint (73), equivalently (74), guarantees that the zeros of P s , z for any s = γ s + i ω s C 0 (since Re s = γ s < 0 ) remain in z < 1 . Property (ii) follows from Property (i) since all points of C v which do not fulfil the constraint are not zeros of Q s . Property (iii) is proved closely to the proof of Property (i) by taking as a first reference for Schur stability through the application of Theorem B a set of real constants fulfilling the decreasing ordering constraints instead of establishing the constraint for all values of the open left-half complex plane. □
Remark 5. 
Theorem 10 is easily applicable to the time-delay dynamic system (71) whose characteristic quasi-polynomial is Q h s = det s I m k = 0 n A k e k h s . Note, by simple inspection, that the quasi-polynomial  Q ¯ h s = e n h s Q h s  has the same number of finite zeros in  R 0 +  as  Q h s . Therefore,  Q h s  is Hurwitz-stable if and only if  Q ¯ h s  is Hurwitz-stable.

3.3. Some Further Results

A corollary of Theorem 10 follows below by taking into account Remark 5. Its proof is direct, and then omitted, from that of Theorem 8 by replacing Q s Q h s , Q ¯ h s and P s , z P ¯ s , z . The use of those replacements by using the factor e h n s implies that the decreasing strictly ordering condition of the coefficients of Theorem 10 is now re-organized to be fixed in reverse order.
Corollary 7. 
Let  Q h s  be the characteristic quasi-polynomial of (72) and let  Q ¯ h s  be defined as
Q ¯ h s = e n h s Q h s = k = 0 n j = 0 m a k j s j e n k h s = k = 0 n a k s e n k h s = k = 0 n a n k s e k h s = k = 0 n j = 0 m a n k j s j e k h s
of degree  m 1  in the argument s with an associated two-variable polynomial  P ¯ s , z = k = 0 n a n k s z k , via the replacement  e h s z , of degrees  n 1  in the argument  z  and  m 1  in the argument  s , where  a n k s = j = 0 m a n k j s j  is a polynomial of degree  m  such that the coefficients  a k j  are real for  k n ¯ 0 ,  j m ¯ 0 . Then, the following properties hold:
(i) 
Assume that for any  s = γ s + i ω s C ,  0 < a n γ s < a n 1 γ s < < a 0 γ s , with  a n k γ s = j = 0 m a n k j γ s j  for  k m ¯ 0 .
Then, all the zeros of  P ¯ γ s , z = k = 0 n a n k γ s z k = k = 0 n j = 0 m a n k j γ s j z k  lie in  t s = t s γ s = max k m ¯ a k γ s / a k 1 γ s = max k m ¯ j = 0 m a k j γ s j / j = 0 m a k 1 j γ s j < 1 . As a result, one has
(1)
P ¯ γ s , z  is  SS α S  for any real constant  α t , 1 , where  t = sup γ s R t s γ s ;
(2)
P ¯ s , z  is  SS t 1 S  for any real constant  β α , 1  if, furthermore,
sup γ s < 0 , ω s R 0 + , z = β   P ¯ γ s + i ω s , z -   P ¯ γ s , z   P ¯ γ s , z < 1
equivalently,
sup γ s < 0 , ω s R 0 + , θ 0 , 2 π k = 0 n j = 0 m a k j γ s 2 + ω s 2 k / 2 β k e i k a r c t g ω s / γ s + θ k = 0 n j = 0 m a k j γ s j β k e i k θ < 1
so that it is SS(1)S;
(3)
If all the zeros of  Q ¯ h s  and  Q h s  lie in  C , then  Q h s  is Hurwitz-stable;
(ii) 
Q h s  is still Hurwitz-stable if  a 0 γ s > a 1 γ s > > a n γ s > 0  does not hold in some nonempty set  C v C , but  Q s 0  for any  s C v  with  Re s = γ s , provided that the supremum is taken in (76) on  γ s C \ C v , ω s R 0 + , z = β , or in (77), on  γ s C \ C v , ω s R 0 + , θ 0 , 2 π .
(iii) 
Assume real constants  a k *  for  k n ¯ 0  satisfying the constraints  0 < a n * < a n 1 * < < a 0 * . Then, all the zeros of  P ¯ s , z , for  s C , lie in  z < ρ  for some real  ρ t * , 1 , where  t * = max k m ¯ a k * / a k 1 * < 1  if
sup Re s < 0 , θ 0 , 2 π k = 0 n j = 0 m a n k j s j a n k * ρ k e i k θ k = 0 n a n k * ρ k e i k θ < 1
and  P ¯ s , z  is  SS α S  for any real constant  α ρ , 1  so that it is  SS 1 S . Also, if all the zeros of  Q ¯ h s  and those of  Q h s  lie in  C , then  Q h s  is Hurwitz-stable. Sufficient conditions for (76) to hold are
sup γ R sup θ 0 , 2 π k = 0 n j = 0 m a n k j γ j a k * e i k θ k = 0 n a n k * e i k θ < ρ n
sup γ R sup θ 0 , 2 π max k n ¯ 0 j = 0 m a k j γ j a k * e i k θ k = 0 n a k * e i k θ < ρ n n + 1
max k n ¯ 0 j = 0 m a n k j γ j a n k * a n j * k j = 0 n a n k * = max k n ¯ 0 j = 0 m a n k j γ j a n k * min j n ¯ 0 a n j * k j = 0 n a n k * < ρ n n + 1 sup γ R max j n ¯ 0
The subsequent result formally states the following expected result. The decreasing ordering condition for the coefficients from its highest to its lowest power cannot hold in the closed complex right-hand-side for the particular case of the delay-free system, provided that it is asymptotically stable.
Proposition 1. 
Assume that the delay-free system (72) is asymptotically stable. Then, the constraint  0 < a 0 γ < a 1 γ < < a n γ  does not hold for  γ 0 .
Proof. 
The delay-free system (72) is defined for h = 0 . Thus, take z = e h s = 1 for any s C since h = 0 . Thus, the characteristic quasi-polynomial Q h s = P s , e h s of (21) and (22) becomes Q 0 s = P s , 1 for the delay-free system (72). If (72) is asymptotically stable then Q 0 s = P s , 1 = 0 only for at most m complex values s (the characteristic zeros of (72)) with Re s σ < 0 for some real constant σ > 0 . Then, Q 0 s = P s , 1 0 for any s C with Re s 0 . Now, proceed by contradiction arguments. If 0 < a 0 γ < a 1 γ < < a n γ holds for some real constant γ 0 then, from Theorem 10 (ii), P γ z = P γ , z has all its zeros in z = z s = e 0 . s = 1 < 1 , since h = 0 , leading to a contradiction. □

4. Further Examples

Now, the basic results are applied to the stability of two fourth and fifth perturbed polynomials under the Schur stability of their nominal versions.
Example 6. 
Consider the fourth-degree nominal polynomial:
P 4 z = 1.1 z 4 + z 3 + 0.99 z 2 + 0.8712 z + 0.766656
The coefficients ordered from the highest to the lowest power of  z  form an ordered strictly decreasing sequence of positive real numbers. By simple inspection, it follows from Theorem A that all its zeros are in  z 1  since the coefficients satisfy the SPOc and then, trivially, the WPOc. Furthermore, it can be seen that  t = min j 4 ¯ p j / p j 1 = 1.01010 , where  p .  are the polynomial coefficients, is an upper bound of all the ratios between consecutive coefficients from the highest to the lowest power of  z . Therefore, all its zeros lie also in  z t 1 = 0.99 < 1  from Theorem B. The moduli upper bound is calculated without a need to factorize the polynomial in zeros as this theorem states. Concerning the weak and strong Schur stability properties, one concludes from Definition 1 that  P 4 z  is  WS t 1 S, since all its zeros satisfy  z t 1  and it is also SS(1)S, since all its zeros satisfy  z < 1 . The calculations of the zeros yield that they are
z 1 , 2 = 0.79124 ± 0.54392 i ;   z 3 , 4 = 0.24124 ± 0.87944 i
of the respective moduli  z 1 , 2 = 0.9601604 < t 1  and  z 3 , 4 = 0.9192733 < t 1 . From the Rouché theorem of zeros, it follows that any perturbed polynomials  Q 4 z = P 4 z + P ˜ 4 z  satisfying  P ˜ 4 z / P 4 z z = 1 < 1  are also SS(1)S, that is, strongly 1-Schur-stable from Theorem 1 or from Theorem 3, which is the classical concept of stability in the discrete framework; that is, all the zeros of  P 4 z  are in the open complex unit circle centred at zero.
Consider the particular polynomial
Q 4 z = P 4 z + P ˜ 4 z = z 4 + 0.9 z 3 + 0.99 z 2 + 0.8712 z + 0.9134
which does not fulfil the constraints SPOc and WPOc, and
P ˜ 4 z = Q 4 z P 4 z = 0.1 z 4 + z 3 + 0.147744
so that  P ˜ 4 z / P 4 z z = 1 0.15433 < 1. Then  Q 4 z  is also SS (1)S. The calculation of the zeros of  Q 4 z  yields 
z 1 , 2 = 0.755087 ± 0.616743 i ;   z 3 , 4 = 0.305097 ± 0.9315591 i
 of the respective moduli  z 1 , 2 = 0.975  and  z 3 , 4 = 0.980 .
On the other hand, all the polynomials belonging to the family
Q 4 z , λ = P 4 z + λ P ˜ 4 z ;   λ λ 0 , λ 0
 are SS (1)S for some  λ 0 > 1 .
Also, if any perturbation polynomial  P ^ ˜ 4 z  of a degree of at most four is prefixed, then all members of the family of polynomials
Q ^ 4 z , λ = P 4 z + λ P ^ ˜ 4 z
are SS(1)S for all  λ λ a , λ a  with  λ a = sup z = 1 P 4 z P ^ ˜ 4 z , since  λ sup z = 1 P ^ ˜ 4 z P 4 z < 1 .
Example 7. 
Consider the fifth-degree nominal polynomial
P 5 z = 2.1 z 5 + 2.0405 z 4 + z 3 + 1.46124997 z 3 + 0.46701 z 2 + 0.066752 z + 0.00338
The coefficients ordered from the highest to the lowest power of  z  form an ordered strictly decreasing sequence of positive real numbers. By simple inspection, it follows from Theorem A that all its zeros are in  z 1  since the coefficients satisfy the SPOc and then, trivially, the WPOc.
Furthermore, it can be seen that  t = min j 5 ¯ p j / p j 1 > 1.026894 , so that  t 1 0.971666 , is an upper-bound of all the ratios between consecutive coefficients from the highest to the lowest power of  z . Therefore, all its zeros lie also in  z 0.971666 < 1  from Theorem B. Concerning the weak and strong Schur´s stability properties, one concludes from Definition 1 that  P 5 z  is  WS t 1 S, since all its zeros satisfy  z t 1 0.971666 < 1  and it is also SS(1)S, since all its zeros satisfy  z < 1 .
Again, the upper-bound of the zeroes moduli is established without performing a polynomial factorization. The calculations of the zeros conclude that they are as follows:
z 1 , 2 = 0.1785874 ± 0.0773172 i ;   z 3 , 4 = 0.2516989 ± 0.5649814 i ;   z 5 = 0.1110939 .
If the polynomial is perturbed with a polynomial perturbation  P ˜ z , then  Q 5 z = P 5 z + P ˜ 5 z  has its zeros in  z < 1  if  P ˜ 5 z / P 5 z z = 1 < 1  from Theorem 3. For instance, consider the perturbation polynomial
P ˜ 5 z = 1.1 z 5 + 0.1408 z 4 + 0.23995762 z 3 + 0.11518 z 2 + 0.02057 z + 0.0018
so that  P ˜ z / P z 0.99037 < 1  for  z = 1 ; then
Q 5 z = P 5 z + P ˜ 5 z = z 5 + 2.1813 z 4 + 1.70120759 z 3 + 0.58219 z 2 + 0.09732 z + 0.00456
is SS(1)S. Its zeros are  0.1151 ,  0.2147 ,  0.3236 ,  0.8743 , and  0.6536 .
On the other hand, all the polynomials belonging to the family
Q 5 z , λ = P 5 z + λ P ˜ 5 z ;   λ λ 0 , λ 0
are SS (1)S for some  λ 0 > 1 .
Also, if any perturbation polynomial  P ^ ˜ 5 z  of a degree of at most five is prefixed, then all members of the family of polynomials
Q ^ 5 z , λ = P 5 z + λ P ^ ˜ 5 z
 are SS(1)S for all  λ λ a , λ a  with  λ a = sup z = 1 P 5 z P ^ ˜ 5 z .
Example 8. 
It is well-known that the particular parameterization of the Möbius transformation defined by  z = s + 1 / s 1  transforms the complex region  z 1  into the closed left-half plane  Re s 0  with corresponding boundaries almost everywhere, that is,  z = 1  for all  z 1  into  Re s = 0 , [32]. One concludes that the continuous polynomial  P c s = s 1 n P z z = s + 1 / s 1  is Hurwitz-stable, that is with roots in  Re s 0  (respectively, strictly Hurwitz with roots in  Re s < 0 ), if and only if the associated discrete one  P z  is WS(1)S (respectively, SS(1)S). Therefore, concerning the two above examples, we have that the following polynomials are Hurwitz:
P 4 c s = s 1 4 P 4 s + 1 / s 1 ;   Q 4 c s = s 1 4 Q 4 s + 1 / s 1
P 5 c s = s 1 5 P 5 s + 1 / s 1 ;   Q 5 c s = s 1 5 Q 5 s + 1 / s 1
Also, if one assumes that a perturbed discrete polynomial has the same degree  n  as that of the nominal one, as it is the case in both above examples, and that the nominal one satisfies the Schur stability condition according to some of the given results then, by linearity, one has the following:
Q n c s = P n c s + P ˜ n c s = s 1 n P n s + 1 / s 1 + P ˜ n s + 1 / s 1
so that
(1)
P n c s = s 1 n P n s + 1 / s 1  is Hurwitz-stable if  P n s + 1 / s 1  is SS(1)S;
(2)
The Rouché test guaranteeing the maintenance of the Hurwitz stability of  Q n c s  from that of  P n c s  becomes
sup ω R 0 + P ˜ n c i ω / P n c i ω < 1

5. Conclusions and Future Work

This article has presented and proved the generalized Schur-type stability results of polynomials based on several forms and generalizations of the Eneström Eneström–Kakeya theorem combined with the Rouché theorem of zeros. The extensions of the Eneström Eneström–Kakeya theorem are applied for a given nominal polynomial which satisfies some decreasing conditions on the polynomial coefficients from the highest to the lowest power of the polynomial expression. Some variants are also derived for the case when the coefficients are not decreasing but consist of a worst-case known deviation from a decreasing rule. Then, Rouché s theorem on zeros is applied to guarantee that the zeros of a perturbed polynomial from the nominal one will be contained in the same complex region as those of the nominal polynomial. The perturbed polynomial is not necessarily structured in the sense that it can be arbitrary but with sufficiently small absolute values of its coefficients. Sufficiency-type conditions are also derived to guarantee the general Schur-type stability of a perturbed polynomial on arbitrary regions which do not necessarily coincide with the open unit circle centred at zero. In a second step, further sufficient conditions are introduced to guarantee that the above generalized Schur stability property persists for the perturbed polynomial within either the same above complex nominal stability region or in some larger one. It is seen that the known weak and, respectively, strong Schur stability in the closed and, respectively, open complex unit circle centred at zero are particular cases of the generalized versions. Some generalizations of the previous results for polynomials are given for the case of the zeros to be included in some annulus instead of within some disc centred at zero. Some further generalizations are provided for the case of quasi-polynomials whose zeros may be interpreted as the characteristic ones of linear continuous-time delayed time-invariant dynamic systems with commensurate constant point delays.
Also, some potential applications related to some control theory stability problems in the discrete framework are also discussed as well as some numerical examples of application for concrete polynomials also being performed. The stability of associated polynomials in the complex open left-half plane, which are related to the Schur-type stability of the original polynomials, via the Möbius transformation of the complex region z 1 into the complex region Re s 0 .
It is foreseen that we will extend these ideas in future works to formalize the stability of the associated continuous-time systems based on that of the original discrete ones obtained from the various versions of the Eneström Eneström–Kakeya type theorems and their given worked extensions. It is also foreseen, based on the proposals and the results in [33,34] that we will develop further study extensions for the case of constraints on the polynomial coefficients if they are eventually complex under separate sufficiency-type explicit conditions on their real and imaginary parts and under the removal of the monotonicity conditions on the real coefficients of such polynomials by satisfying alternative conditions by the involvement of multiplicative constants on some of the coefficients. Finally, Eneström Eneström–Kakeya theorem-type extensions could be performed combined with the Rouché theorem of zeros to derive robust stability results for quasi-polynomials.

Funding

Basque Government [IT1555-22].

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. De la Sen, M.; Barcena, R. Stability results for point time-delay systems obtained via Rouche’s theorem. Appl. Anal. 2004, 83, 157–183. [Google Scholar] [CrossRef]
  2. Dewan, K.K.; Govil, N.K. On Eneström-Kakeya theorem. J. Approx. Theory 1984, 42, 239–244. [Google Scholar] [CrossRef]
  3. Shah, M.A.; Swroop, R.; Sofi, H.M.; Nisar, I. A Generalization of Eneström-Kakeya Theorem and a Zero Free Region of a Polynomial. J. Appl. Math. Phys. 2021, 9, 1271–1277. [Google Scholar] [CrossRef]
  4. Frazier, W.T.; Gardner, R. Eneström-Kakeya theorem for new classes of polynomials. Acta Comment. Univ. Tartu. Math. 2019, 23, 103–115. [Google Scholar] [CrossRef]
  5. Gardner, R.; Govil, N. On the Location of the Zeros of a Polynomial. J. Approx. Theory 1994, 78, 286–292. [Google Scholar] [CrossRef]
  6. Gardner, R.B.; Govil, N.K. Eneström-Kakeya Theorem and Some of Its Generalizations. In Current Topics in Pure and Computational Complex Analysis; Joshi, S., Dorff, M., Lahiri, I., Eds.; Birkhauser: Basel, Switzerland, 2014. [Google Scholar]
  7. Dewan, K.K.; Bidkham, M. On the Eneström-Kakeya theorem. J. Math. Anal. Appl. 1993, 180, 29–36. [Google Scholar] [CrossRef]
  8. Jain, V.K. On Cauchy´s bound for zeros of a polynomial. Turk. J. Math. 2006, 30, 9. [Google Scholar]
  9. Chen, W. On the polynomials with all their zeros on the unit circle. J. Math. Anal. Appl. 1995, 190, 714–724. [Google Scholar] [CrossRef]
  10. Marden, M. The geometry of the zeros of a polynomial in a complex variable. In Mathematical Surveys, No. 3; American Mathematical Society: Providence, RI, USA, 1949. [Google Scholar]
  11. Aziz, A.; Mohammad, Q.G. On the zeros of a certain class of polynomials and related analytic functions. J. Math. Anal. Appl. 1980, 75, 495–502. [Google Scholar] [CrossRef]
  12. Ramesh, P. Stability analysis of multi-dimensional linear discrete system and root distribution using sign criterion with real coefficients. Circuits Syst. 2016, 7, 100–109. [Google Scholar] [CrossRef]
  13. De la Sen, M.; Luo, N. On the uniform exponential stability of a wide class of linear time-delay systems. J. Math. Anal. Appl. 2004, 289, 456–476. [Google Scholar] [CrossRef]
  14. De la Sen, M. Sufficiency-type stability and stabilization criteria for linear time-invariant systems with point delays. Acta Appl. Math. 2004, 83, 235–256. [Google Scholar] [CrossRef]
  15. Gorécki, H.; Fuksa, S.; Grabowski, P.; Korytowski, A. Analysis and Synthesis of Time-Delay Systems; John Wiley & Sons: Warszawa, Poland, 1989. [Google Scholar]
  16. De la Sen, M. Stability criteria for linear time-invariant systems with point delays based on one-dimensional Routh Hurwitz tests. Appl. Math. Comput. 2007, 187, 1199–1207. [Google Scholar] [CrossRef]
  17. Niculescu, S.I. Delay Effects on Stability. A Robust Control Approach; Lecture Notes in Control and Information Sciences; Springer: Berlin, Germany, 2001. [Google Scholar]
  18. Kailath, T. Linear Systems; Prentice Hall: New York, NY, USA, 1980. [Google Scholar]
  19. Dorf, R.C. Les Variables d´État dans L’Analyse et la Synthèse des Systèmes de Commande; Bibliothèque de l’Automaticien (sous la Direction de Pierre Naslin): Dunod, Paris, 1967. [Google Scholar]
  20. Ngo, K.T.; Erickson, K.T. Stability of discrete matrix polynomials. IEEE Trans. Autom. Control 1997, 42, 538–542. [Google Scholar] [CrossRef]
  21. Kawamura, T.; Shima, M. Robust stability of characteristic polynomials with monotonicity. Nonlinear Anal. Theory Methods Appl. 1997, 30, 5109–5119. [Google Scholar] [CrossRef]
  22. Aziz, A.; Zargar, B.A. Some extensions of the Eneström-Kakeya theorem. Glas. Math. 1996, 31, 239–244. [Google Scholar]
  23. Kumar-Pannala, R.K.P. Some extensions of Eneström-Kakeya theorem. Turk. J. Comput. Math. Educ. 2021, 12, 2823–2829. [Google Scholar]
  24. Gardner, R.; Gladin, M. Generalizations of the Eneström-Kakeya theorem involving weakened hypotheses. Appl. Math. 2022, 2, 687–699. [Google Scholar] [CrossRef]
  25. Zargar, B.A.; Guizar, M.H.; Akhter, T. Zero inclusions and zero free regions for Kakeya type polynomials. Aligarh Bull. Math. 2023, 42, 1–13. [Google Scholar]
  26. Zhou, B. On asymptotic stability of linear time-varying systems. Automatica 2016, 68, 266–276. [Google Scholar] [CrossRef]
  27. Maggia, M.; Eisa, S.A.; Taha, H.E. On higher-order averaging of time-periodic systems: Reconciliation of two averaging techniques. Nonlinear Dyn. 2020, 99, 813–836. [Google Scholar] [CrossRef]
  28. Guo, S.; Han, L. Stability and Control of Nonlinear Time-Varying Systems; Springer Nature Singapore Pte. Ltd.: Singapore, 2018. [Google Scholar]
  29. Bounemeur, A.; Chemachema, M. Adaptive fuzzy fault-tolerant control using Nussbaum-type function with state-dependent actuator failures. Neural Comput. Appl. 2021, 33, 191–208. [Google Scholar] [CrossRef]
  30. Bey, O.; Chemachema, M. Decentralized event-triggered output feedback adaptive neural network control for a class of MIMO uncertain strict-feedback nonlinear systems with input saturation. Int. J. Adapt. Control Signal Process. 2024, 38, 1420–1441. [Google Scholar] [CrossRef]
  31. Bey, O.; Chemachema, M. Finite-time event-triggered output-feedback adaptive decentralized echo-state network fault-tolerant control for interconnected pure-feedback nonlinear systems with input saturation and external disturbances: A fuzzy control-error approach. Inf. Sci. 2024, 669, 120557. [Google Scholar] [CrossRef]
  32. Sévely, Y. Systèmes et Asservissements Linéaires Echatillonnés; Universite Virtuelle de Tunis: Dunod, Paris, 1993. [Google Scholar]
  33. Mir, S.; Liman, A. On the weakened hypotheses-based generalizations of the Eneström-Kakeya theorem. Korean J. Math. 2024, 32, 229–243. [Google Scholar]
  34. Chishti, M.S.; Tyagi, V.K.; Mir, M.I. Some bounds for zeros of a polynomial with restricted coefficients. J. Korean Soc. Math. Educ. Ser. B Pure Appl. Math. 2024, 31, 49–56. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

De la Sen, M. Some Combined Results from Eneström–Kakeya and Rouché Theorems on the Generalized Schur Stability of Polynomials and the Stability of Quasi-Polynomials-Application to Time-Delay Systems. Mathematics 2024, 12, 3023. https://doi.org/10.3390/math12193023

AMA Style

De la Sen M. Some Combined Results from Eneström–Kakeya and Rouché Theorems on the Generalized Schur Stability of Polynomials and the Stability of Quasi-Polynomials-Application to Time-Delay Systems. Mathematics. 2024; 12(19):3023. https://doi.org/10.3390/math12193023

Chicago/Turabian Style

De la Sen, Manuel. 2024. "Some Combined Results from Eneström–Kakeya and Rouché Theorems on the Generalized Schur Stability of Polynomials and the Stability of Quasi-Polynomials-Application to Time-Delay Systems" Mathematics 12, no. 19: 3023. https://doi.org/10.3390/math12193023

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop