Convex combinations of G-stable polynomials
From MaRDI portal
Publication:1181840
DOI10.1007/BF01952239zbMath0746.93052MaRDI QIDQ1181840
Publication date: 27 June 1992
Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Robust stabilization against structured perturbations
- Parametric uncertainty and unmodeled dynamics: Analysis via parameter space methods
- The robust root locus
- A necessary and sufficient condition for the stability of convex combinations of stable polynomials or matrices
- Root locations of an entire polytope of polynomials: It suffices to check the edges
- Robust stability of perturbed systems with time delays
- Convex combinations of stable polynomials
- A symmetric matrix criterion for polynomial root clustering
- A generalization of the Routh-Hurwitz stability criteria and an application to a problem in robust controller design
- Fast stability checking for the convex combination of stable polynomials
- A simple general proof of Kharitonov's generalized stability criterion
- Robust Schur stability of a polytope of polynomials
- A generalization of Kharitonov's theorem; Robust stability of interval plants
- A generalization of Kharitonov's four-polynomial concept for robust stability problems with linearly dependent coefficient perturbations
- An alternative proof of Kharitonov's theorem
- Parameter space methods for robust control design: a guided tour
- Tests for Hurwitz and Schur properties of convex combination of complex polynomials
- Absolute stability and parameter sensitivity
This page was built for publication: Convex combinations of G-stable polynomials
