| Abstract: | Determining the robust stability of interval quasipolynomials leads to a NP problem: an enormous number of testing edge polynomials. This paper develops an efficient approach to reducing the number of testing edge polynomials. This paper solves the stability test problem of interval quasipolynomials by transforming interval quasipolynomials into two‐dimensional (2‐D) interval polynomials. It is shown that the robust stability of an interval 2‐D polynomial can ensure the stability of the quasipolynomial, and the algebraic test algorithm for 2‐D s‐z interval polynomials is provided. The stability of 2‐D s‐z vertex polynomials and 2‐D s‐z edge polynomials were tested by using a Schur Table of complex polynomials. |
