Testing the robust Schur stability of a segment of complex polynomials

DOI10.1080/00207720110035273zbMath1009.93061OpenAlexW2106503420MaRDI QIDQ3152486

Hwang, Chyi, Yang, Shih-Feng

Publication date: 10 December 2002

Published in: International Journal of Systems Science (Search for Journal in Brave)

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

zbMATH Keywords

robust stabilitydiscrete-time linear systemsinterval polynomials

Mathematics Subject Classification ID

Discrete-time control/observation systems (93C55) 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
• Root locations of an entire polytope of polynomials: It suffices to check the edges
• 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
• Some Schur-stability criteria for uncertain systems with complex coefficients
• Robust Schur stability of a polytope of polynomials
• An optimal fraction free Routh array†
• Robust stability of two-dimensional digital filters under coefficient perturbation
• Root clustering for convex combination of complex polynomials
• Routh’s Algorithm: A Centennial Survey
• Convergence condition for convex combinations of two polynomials
• On the stability of a segment of polynomials
• Extreme point result for robuststability of discrete systems with complex coefficients in a diamond
• 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: Testing the robust Schur stability of a segment of complex polynomials