The rank one mixed \(\mu\) problem and `Kharitonov-type' analysis

DOI10.1016/0005-1098(94)90050-7zbMath0815.93026OpenAlexW1989848114MaRDI QIDQ1344365

Peter M. Young

Publication date: 29 June 1995

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://resolver.caltech.edu/CaltechCDSTR:1993.015

zbMATH Keywords

robustnesscomputational methodsgeneral mixed \(\mu\) problem

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Linear systems in control theory (93C05)

Related Items

Computational complexity reduction in scaled \({\mathcal H}_ \infty\) synthesis ⋮ Nonnegative matrices and their structured singular values ⋮ Structured singular value approach for systems with parametric uncertainty ⋮ A gain-based lower bound algorithm for real and mixed \(\mu \) problems

Cites Work

• A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
• Root locations of an entire polytope of polynomials: It suffices to check the edges
• Fast computation of the multivariable stability margin for real interrelated uncertain parameters
• Robustness in the presence of mixed parametric uncertainty and unmodeled dynamics
• Parameter space methods for robust control design: a guided tour
• On continuity/discontinuity in robustness indicators
• Unnamed Item
• Unnamed Item
• Unnamed Item