A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
From MaRDI portal
(Redirected from Publication:583166)
Recommendations
- A unified approach for the stability robustness of polynomials in a convex set
- scientific article; zbMATH DE number 853075
- Real and complex stability radii of polynomial matrices
- Computation of stability radius for families of bivariate polynomials
- Stability of polynomials under coefficient perturbation
Cites work
- scientific article; zbMATH DE number 4202149 (Why is no real title available?)
- scientific article; zbMATH DE number 3616739 (Why is no real title available?)
- scientific article; zbMATH DE number 1022658 (Why is no real title available?)
- scientific article; zbMATH DE number 3399886 (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 unified approach for the stability robustness of polynomials in a convex set
- Maximal unidirectional perturbation bounds for stability of polynomials and matrices
- Root locations of an entire polytope of polynomials: It suffices to check the edges
Cited in
(26)- Computation of the minimum destabilizing volume for interval and affine families of polynomials
- The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval
- Structured singular values and stability analysis of uncertain polynomials. I: The generalized \(\mu\)
- Necessary and sufficient conditions for robust stability of discrete systems with coefficients depending continuously on two interval parameters
- Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization
- scientific article; zbMATH DE number 1512932 (Why is no real title available?)
- A formula for computation of the real stability radius
- A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension
- An overview of extremal properties for robust control of interval plants
- Robust stability: The computational complexity point of view
- Exact solution for the rank-one structured singular value with repeated complex full-block uncertainty
- The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach
- The nearest polynomial with a zero in a given domain
- Structured singular values and stability analysis of uncertain polynomials. II: A missing link
- The rank one mixed \(\mu\) problem and `Kharitonov-type' analysis
- A unified approach to computing the nearest complex polynomial with a given zero
- Bibliography on robust control
- Applications of optimization methods to robust stability of linear systems
- Efficient computation of the nearest polynomial by linearized alternating direction method
- 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
- Computation of parameter stability margins using polynomial programming techniques
- A unified approach for the stability robustness of polynomials in a convex set
- Computation of the stability radius of a Hurwitz polynomial with diamond-like uncertainties
- Computation of stability radius for families of bivariate polynomials
- Real and complex stability radii of polynomial matrices
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)
