A test for robust Hurwitz stability of convex combinations of complex polynomials

DOI10.1016/S0016-0032(02)00014-5MaRDI QIDQ697792zbMATH OpenOpenAlexFDO

Authors Shih-Feng Yang, Chyi Hwang

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

zbMATH Keywords

Euclidean algorithmlinear systemspolynomialsrobust stabilityinterval polynomial

Mathematics Subject Classification ID

Robust stability (93D09) Frequency-response methods in control theory (93C80) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Recommendations

• Testing the robust Schur stability of a segment of complex polynomials
• Algebraic test for the Hurwitz stability of a given segment of polynomials
• The use of Routh array for testing the Hurwitz property of a segment of polynomials.
• scientific article; zbMATH DE number 4074933
• Robust Hurwitz and Schur stability via interval positivity

Cites work

• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 3636452 (Why is no real title available?)
• scientific article; zbMATH DE number 794708 (Why is no real title available?)
• scientific article; zbMATH DE number 5050658 (Why is no real title available?)
• A necessary and sufficient condition for the stability of convex combinations of stable polynomials or matrices
• A note on convex combinations of polynomials
• A survey of extreme point results for robustness of control systems
• An optimal fraction free Routh array†
• Bibliography on robust control
• Convex combinations of stable polynomials
• Fast projection methods for minimal design problems in linear system theory
• Fast stability checking for the convex combination of stable polynomials
• Necessary and sufficient conditions for root clustering of a polytope of polynomials in a simply connected domain
• Network realizability theory approach to stability of complex polynomials
• On the stability of a segment of polynomials
• Robust control. Systems with uncertain physical parameters. In co-operation with A. Bartlett, D. Kaesbauer, W. Sienel, R. Steinhauser
• Robustness of a discrete system
• Root clustering for convex combination of complex polynomials
• Root locations of an entire polytope of polynomials: It suffices to check the edges
• Routh’s Algorithm: A Centennial Survey
• Tests for Hurwitz and Schur properties of convex combination of complex polynomials
• The use of Routh array for testing the Hurwitz property of a segment of polynomials.

Cited in

(8)

• Algebraic test for the Hurwitz stability of a given segment of polynomials
• Open problems related to the Hurwitz stability of polynomials segments
• The use of Routh array for testing the Hurwitz property of a segment of polynomials.
• Robust Hurwitz and Schur stability via interval positivity
• Robust Hurwitz stability of a class of complex polynomials arising fromH∞ control theory
• Testing the robust Schur stability of a segment of complex polynomials
• scientific article; zbMATH DE number 4074933 (Why is no real title available?)
• An algorithm for segment stability

This page was built for publication: A test for robust Hurwitz stability of convex combinations of complex polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697792)