A test for robust Hurwitz stability of convex combinations of complex polynomials
The paper describes an algorithm for testing Hurwitz stability (location of the roots in the open left half-plane) of a segment of polynomials with complex coefficients (a polynomial affected by one uncertain parameter belonging to a given interval), a problem with applications in linear systems robust control. The algorithm is a minor extension of an existing fraction-free Routh array algorithm for real polynomials. It is based on the Euclidean algorithm to extract the greatest divisor of two polynomials. Entries of the Routh table are kept polynomial in the uncertain parameter, which allows robust stability to be checked in a finite number of arithmetic operations and prevents the use of a numerical polynomial root-finding algorithm. The paper is the exact continuous-time counterpart of a previous publication of the authors [Int. J. Syst. Sci. 32, 1243-1250 (2001; Zbl 1009.93061)], which is surprisingly not referenced here.
- 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
- 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
- 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?)
- 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.
- Open problems related to the Hurwitz stability of polynomials segments
- Algebraic test for the Hurwitz stability of a given segment of polynomials
- 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?)
- Robust Hurwitz and Schur stability via interval positivity
- The use of Routh array for testing the Hurwitz property of a segment of polynomials.
- 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)
