TY - JOUR

T1 - Zero Location with Respect to the Unit Circle of DiscreteTime Linear System Polynomials

AU - Bistritz, Yuval

PY - 1984/9

Y1 - 1984/9

N2 - The location of the zeros of discrete systems characteristic polynomials with respect to the unit circle is investigated. A new sequence of symmetric polynomials of descending degrees is defined for the characteristic polynomial and the number of zeros inside and outside the unit circle is shown to be related to a certain sign variation pattern of the polynomials in the sequence. A stability table based on this sequence is presented to obtain the sought distribution of zeros. The new table is close in appearance, size, and number of arithmetic operations to the Routh table used for continuous-time system polynomials. By comparison with the table of Jury, based on the theory of Marden, Cohn, and Schur, the new table involves about half the number of entries and a corresponding significant saving in computations. The study includes a detailed consideration of all possible cases of singular conditions so that the complete information on the number of zeros inside, outside, and on the unit circle is always obtained (including some additional information on possible reciprocal pairs of zeros). Necessary and sufficient conditions for a polynomial to have all its zeros inside the unit circle are obtained as a special outcome. Other additional necessary conditions, that are useful to shorten procedures when the table is used only for testing the stability of the system, are also given.

AB - The location of the zeros of discrete systems characteristic polynomials with respect to the unit circle is investigated. A new sequence of symmetric polynomials of descending degrees is defined for the characteristic polynomial and the number of zeros inside and outside the unit circle is shown to be related to a certain sign variation pattern of the polynomials in the sequence. A stability table based on this sequence is presented to obtain the sought distribution of zeros. The new table is close in appearance, size, and number of arithmetic operations to the Routh table used for continuous-time system polynomials. By comparison with the table of Jury, based on the theory of Marden, Cohn, and Schur, the new table involves about half the number of entries and a corresponding significant saving in computations. The study includes a detailed consideration of all possible cases of singular conditions so that the complete information on the number of zeros inside, outside, and on the unit circle is always obtained (including some additional information on possible reciprocal pairs of zeros). Necessary and sufficient conditions for a polynomial to have all its zeros inside the unit circle are obtained as a special outcome. Other additional necessary conditions, that are useful to shorten procedures when the table is used only for testing the stability of the system, are also given.

UR - http://www.scopus.com/inward/record.url?scp=0021497366&partnerID=8YFLogxK

U2 - 10.1109/PROC.1984.12993

DO - 10.1109/PROC.1984.12993

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0021497366

SN - 0018-9219

VL - 72

SP - 1131

EP - 1142

JO - Proceedings of the IEEE

JF - Proceedings of the IEEE

IS - 9

ER -