Root clustering for convex combination of complex polynomials

DOI10.1109/9.256373zbMATH Open0770.93043OpenAlexW2086275064MaRDI QIDQ4030735FDOQ4030735

Authors: Shaul Gutman 

Publication date: 1 April 1993

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.256373

Recommendations

• scientific article
• A necessary and sufficient condition for stability of the convex combination of polynomials
• Convex combinations of stable polynomials
• Schur stability of the convex combination of complex polynomials
• A necessary and sufficient condition for the stability of convex combinations of stable polynomials or matrices

zbMATH Keywords

critical constraint

Mathematics Subject Classification ID

Linear systems in control theory (93C05)

Cited In (7)

• A test for robust Hurwitz stability of convex combinations of complex polynomials
• Root clustering of a real matrix in a sector
• Complexity Analysis of Root Clustering for a Complex Polynomial
• Root clustering in subregions of the complex plane
• Testing the robust Schur stability of a segment of complex polynomials
• New Practical Advances in Polynomial Root Clustering
• The use of Routh array for testing the Hurwitz property of a segment of polynomials.

This page was built for publication: Root clustering for convex combination of complex polynomials

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