A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
DOI10.1016/0167-6911(89)90108-4zbMATH Open0691.93045OpenAlexW2014467673MaRDI QIDQ583166FDOQ583166
Publication date: 1989
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6911(89)90108-4
Sensitivity (robustness) (93B35) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Stability of control systems (93D99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Root locations of an entire polytope of polynomials: It suffices to check the edges
- A generalization of Kharitonov's theorem; Robust stability of interval plants
- Maximal unidirectional perturbation bounds for stability of polynomials and matrices
- A unified approach for the stability robustness of polynomials in a convex set
- A generalization of Kharitonov's four-polynomial concept for robust stability problems with linearly dependent coefficient perturbations
Cited In (24)
- The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach
- Efficient computation of the nearest polynomial by linearized alternating direction method
- The nearest polynomial with a zero in a given domain
- Computation of stability radius for families of bivariate polynomials
- Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization
- A unified approach to computing the nearest complex polynomial with a given zero
- Structured singular values and stability analysis of uncertain polynomials. I: The generalized \(\mu\)
- Exact solution for the rank-one structured singular value with repeated complex full-block uncertainty
- Real and complex stability radii of polynomial matrices
- Computation of the stability radius of a Hurwitz polynomial with diamond-like uncertainties
- The rank one mixed \(\mu\) problem and `Kharitonov-type' analysis
- Bibliography on robust control
- A formula for computation of the real stability radius
- Computation of parameter stability margins using polynomial programming techniques
- The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval
- Title not available (Why is that?)
- An overview of extremal properties for robust control of interval plants
- Necessary and sufficient conditions for robust stability of discrete systems with coefficients depending continuously on two interval parameters
- The nearest complex polynomial with a zero in a given complex domain
- Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
- A unified approach for the stability robustness of polynomials in a convex set
- Applications of optimization methods to robust stability of linear systems
- A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension
- Structured singular values and stability analysis of uncertain polynomials. II: A missing link
This page was built for publication: A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583166)
