Testing the robust Schur stability of a segment of complex polynomials

DOI10.1080/00207720110035273MaRDI QIDQ3152486zbMATH OpenOpenAlexFDO

Authors Shih-Feng Yang, Chyi Hwang

Publication date 10 December 2002

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207720110035273

zbMATH Keywords

discrete-time linear systemsinterval polynomialsrobust stability

Mathematics Subject Classification ID

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

Recommendations

• A test for robust Hurwitz stability of convex combinations of complex polynomials
• Robust stability: The computational complexity point of view
• Algebraic test for the Hurwitz stability of a given segment of polynomials
• Conditions for the Schur stability of segments of polynomials of the same degree
• Robust Schur stability of polynomials with polynomial parameter dependency

Cites work

• A note on convex combinations of polynomials
• An optimal fraction free Routh array†
• Convergence condition for convex combinations of two polynomials
• Convex combinations of stable polynomials
• Extreme point result for robuststability of discrete systems with complex coefficients in a diamond
• Fast stability checking for the convex combination of stable polynomials
• scientific article; zbMATH DE number 5050658 (Why is no real title available?)
• Necessary and sufficient conditions for root clustering of a polytope of polynomials in a simply connected domain
• On the stability of a segment of polynomials
• Robust Schur stability of a polytope of polynomials
• Robust stability of two-dimensional digital filters under coefficient perturbation
• 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
• Some Schur-stability criteria for uncertain systems with complex coefficients
• 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

(9)

• Robust stability: The computational complexity point of view
• Robust Schur stability of polynomials with polynomial parameter dependency
• Geometry and dynamics of the Schur-Cohn stability algorithm for one variable polynomials
• Algebraic test for the Hurwitz stability of a given segment of polynomials
• Schur stability of interval polynomials
• Conditions for the Schur stability of segments of polynomials of the same degree
• A root-distribution criterion for an interval polynomial in a sector
• A test for robust Hurwitz stability of convex combinations of complex polynomials
• An algorithm for segment stability

This page was built for publication: Testing the robust Schur stability of a segment of complex polynomials

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