Pages that link to "Item:Q583166"

The following pages link to A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations (Q583166):

Displaying 19 items.

• The nearest complex polynomial with a zero in a given complex domain (Q650944) (← links)
• Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions (Q651875) (← links)
• A unified approach for the stability robustness of polynomials in a convex set (Q1194901) (← links)
• Computation of the stability radius of a Hurwitz polynomial with diamond-like uncertainties (Q1275063) (← links)
• Applications of optimization methods to robust stability of linear systems (Q1331112) (← links)
• Structured singular values and stability analysis of uncertain polynomials. I: The generalized \(\mu\) (Q1333849) (← links)
• Structured singular values and stability analysis of uncertain polynomials. II: A missing link (Q1333854) (← links)
• The rank one mixed \(\mu\) problem and `Kharitonov-type' analysis (Q1344365) (← links)
• Real and complex stability radii of polynomial matrices (Q1611909) (← links)
• Computation of stability radius for families of bivariate polynomials (Q1801478) (← links)
• Bibliography on robust control (Q1802023) (← links)
• Necessary and sufficient conditions for robust stability of discrete systems with coefficients depending continuously on two interval parameters (Q1802031) (← links)
• An overview of extremal properties for robust control of interval plants (Q1802518) (← links)
• A formula for computation of the real stability radius (Q1898494) (← links)
• The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach (Q1985438) (← links)
• Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization (Q2290644) (← links)
• A unified approach to computing the nearest complex polynomial with a given zero (Q2354766) (← links)
• The nearest polynomial with a zero in a given domain (Q2378507) (← links)
• Efficient computation of the nearest polynomial by linearized alternating direction method (Q2663820) (← links)