An efficient algorithm for checking the robust stability of a polytope of polynomials
From MaRDI portal
Publication:809043
DOI10.1007/BF02551283zbMath0731.93074MaRDI QIDQ809043
Publication date: 1991
Published in: MCSS. Mathematics of Control, Signals, and Systems (Search for Journal in Brave)
93D09: Robust stability
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
Related Items
Cites Work
- Unnamed Item
- Root locations of an entire polytope of polynomials: It suffices to check the edges
- An edge theorem for polytopes of polynomials which can drop in degree
- The stability of a family of polynomials can be deduced from a finite number 0(k/sup 3/) of frequency checks
- Some results on robust stability of discrete-time systems
- A generalization of Kharitonov's four-polynomial concept for robust stability problems with linearly dependent coefficient perturbations