Robust Stability of Discrete-Time Polynomials with Polynomic Dependency

P. Hušek (Czech Republic)


Robust stability, Polynomials, Parametric uncertainty, Fast Fourier transform, Sign-Decomposition


This paper presents very efficient and numerically stable method for testing the robust stability of discrete-time polynomials with polynomic dependency of their coefficients. The method is based on Modified Jury criterion with the elements being multivariate polynomials. The computation of those elements is performed using very efficient and reliable method based on multivariate fast Fourier transform algorithm. Positivity of elements is tested by an algorithm using a griding of space of uncertain parameters based on Sign decomposition. The necessary and sufficient condition of robust stability is obtained.

Important Links:

Go Back