Robust stability: The computational complexity point of view

Related Items

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Robust Schur stability of a complex-coefficient polynomials set with coefficients in a diamond
Necessary and sufficient conditions for quadratic stabilizability of an uncertain system
Robustness of a discrete system
Root locations of an entire polytope of polynomials: It suffices to check the edges
Maximal unidirectional perturbation bounds for stability of polynomials and matrices
Extreme point results for robust stability of interval plants: Beyond first order compensators
Robust stability: The computational complexity point of view
Counter-example to a recent result on the stability of interval matrices by S. Bialas
An elementary proof of Kharitonov's stability theorem with extensions
The minimal dimension of stable faces required to guarantee stability of a matrix polytope
A class of stability regions for which a Kharitonov-like theorem holds
A dual result to Kharitonov's theorem
On the stability properties of polynomials with perturbed coefficients
Some discrete-time counterparts to Kharitonov's stability criterion for uncertain systems
Robust Schur polynomial stability and Kharitonov's theorem
Stability of a polytope of matrices: counterexamples
A class of weak Kharitonov regions for robust stability of linear uncertain systems
Counterexample and correction to a recent result on robust stability of a diamond of complex polynomials
An extreme point result of robust stability of a diamond of polynomials
Stability of a complex polynomial set with coefficients in a diamond and generalizations
A simple test for zeros of a complex polynomial in a sector
Generalization of strong Kharitonov theorems to the left sector