A test for robust Hurwitz stability of convex combinations of complex polynomials
From MaRDI portal
Publication:697792
DOI10.1016/S0016-0032(02)00014-5zbMath1030.93038OpenAlexW2079794445MaRDI QIDQ697792
Publication date: 17 September 2002
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0016-0032(02)00014-5
Frequency-response methods in control theory (93C80) Robust stability (93D09) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robustness of a discrete system
- A necessary and sufficient condition for the stability of convex combinations of stable polynomials or matrices
- Root locations of an entire polytope of polynomials: It suffices to check the edges
- Fast projection methods for minimal design problems in linear system theory
- A survey of extreme point results for robustness of control systems
- Bibliography on robust control
- Robust control. Systems with uncertain physical parameters. In co-operation with A. Bartlett, D. Kaesbauer, W. Sienel, R. Steinhauser
- Convex combinations of stable polynomials
- Necessary and sufficient conditions for root clustering of a polytope of polynomials in a simply connected domain
- Fast stability checking for the convex combination of stable polynomials
- Network realizability theory approach to stability of complex polynomials
- An optimal fraction free Routh array†
- Root clustering for convex combination of complex polynomials
- Routh’s Algorithm: A Centennial Survey
- On the stability of a segment of polynomials
- Tests for Hurwitz and Schur properties of convex combination of complex polynomials
- A note on convex combinations of polynomials
- The use of Routh array for testing the Hurwitz property of a segment of polynomials.
This page was built for publication: A test for robust Hurwitz stability of convex combinations of complex polynomials
