Fast stability checking for the convex combination of stable polynomials
From MaRDI portal
Publication:3486480
Recommendations
- scientific article; zbMATH DE number 5290516
- An efficient algorithm for checking the robust stability of a polytope of polynomials
- A fast iterative method for determining the stability of a polynomial
- Convex combinations of stable polynomials
- A unified approach for the stability robustness of polynomials in a convex set
- A necessary and sufficient condition for stability of the convex combination of polynomials
- scientific article; zbMATH DE number 4213760
- A necessary and sufficient condition for the stability of convex combinations of stable polynomials or matrices
- Stability Optimization for Polynomials and Matrices
- scientific article; zbMATH DE number 4037632
Cited in
(10)- 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.
- A panoramic sketch about the robust stability of time-delay systems and its applications
- Robust stability of control systems with polytopical uncertainty: a Nyquist approach
- A structural approach to robust stability of polynomials
- Convex combinations of G-stable polynomials
- A fast method for obtaining convex combination coefficients
- Testing the robust Schur stability of a segment of complex polynomials
- A test for robust Hurwitz stability of convex combinations of complex polynomials
- A New Algorithm for Testing the Stability of a Polytope: A Geometric Approach for Simplification
This page was built for publication: Fast stability checking for the convex combination of stable polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3486480)