Convex combinations of G-stable polynomials
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3482173 (Why is no real title available?)
- A generalization of Kharitonov's four-polynomial concept for robust stability problems with linearly dependent coefficient perturbations
- A generalization of Kharitonov's theorem; Robust stability of interval plants
- A generalization of the Routh-Hurwitz stability criteria and an application to a problem in robust controller design
- A necessary and sufficient condition for the stability of convex combinations of stable polynomials or matrices
- A simple general proof of Kharitonov's generalized stability criterion
- A symmetric matrix criterion for polynomial root clustering
- Absolute stability and parameter sensitivity
- An alternative proof of Kharitonov's theorem
- Convex combinations of stable polynomials
- Fast stability checking for the convex combination of stable polynomials
- Parameter space methods for robust control design: a guided tour
- Parametric uncertainty and unmodeled dynamics: Analysis via parameter space methods
- Robust Schur stability of a polytope of polynomials
- Robust stability of perturbed systems with time delays
- Robust stabilization against structured perturbations
- Root locations of an entire polytope of polynomials: It suffices to check the edges
- Tests for Hurwitz and Schur properties of convex combination of complex polynomials
- The robust root locus
Cited in
(3)
This page was built for publication: Convex combinations of G-stable polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1181840)
