A circular stability test for general polynomials

Yuval Bistritz*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

51 Scopus citations

Abstract

We extend a new stability test proposed recently for discrete system polynomials [1] to polynomials with complex coefficients. The method is based on a three-term recursion of a conjugate symmetric sequence of polynomials. The complex version has the same relative improved efficiency as the real version in comparison to the classical Schur-Cohn formulation for counting the number of zeros of a polynomial with respect to the unit circle. Furthermore, if desirable, the complex text can be carried out using only real polynomials and arithmetic.

Original languageEnglish
Pages (from-to)89-97
Number of pages9
JournalSystems and Control Letters
Volume7
Issue number2
DOIs
StatePublished - Apr 1986
Externally publishedYes

Funding

FundersFunder number
U.S. Army Research OfficeDAAG29-83-K-0028

    Keywords

    • Complex symmetric polynomials
    • Stability criterion for discrete-time systems
    • Three-term polynomial recursions
    • Zeros location in the unit circle

    Fingerprint

    Dive into the research topics of 'A circular stability test for general polynomials'. Together they form a unique fingerprint.

    Cite this