An efficient algorithm for checking the robust stability of a polytope of polynomials
From MaRDI portal
Publication:809043
DOI10.1007/BF02551283zbMath0731.93074OpenAlexW2129634154MaRDI QIDQ809043
Publication date: 1991
Published in: MCSS. Mathematics of Control, Signals, and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02551283
Robust stability (93D09) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15)
Related Items
Stabilization of polytopes of plants by their vertices, A survey of computational complexity results in systems and control, Bibliography on robust control
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
