Computing bounds for the mixed μ problem
From MaRDI portal
Recommendations
Cites work
Cited in
(23)- Computation of the robustness margin with the skewed \(\mu\) tool
- The rank one mixed \(\mu\) problem and `Kharitonov-type' analysis
- Robustness analysis with full-structured uncertainties
- The complex structured singular value
- A fast algorithm for the computation of an upper bound on the -norm
- Ellipsoidal bounds on state trajectories for discrete-time systems with linear fractional uncertainties
- A nonlinear programming technique to compute a~tight~lower bound for the real structured singular value
- Structured singular value approach for systems with parametric uncertainty
- Robust multiple model adaptive control: Modified using \(\nu \)-gap metric
- Robust controller order reduction
- MIXED μ PROBLEMS AND BRANCH AND BOUND TECHNIQUES
- A lower bound for the mixed μ problem
- Numerical Methods for Robust Control
- Application of real/mixed μ computational techniques to anH∞ missile autopilot
- Properties of the mixed μ problem and its bounds
- Generalized mixed-μ bounds for real and complex multiple-block uncertainty with internal matrix structure
- Development of a skew µ lower bound
- Worst-case stability and performance with mixed parametric and dynamic uncertainties
- A low rank ODE based technique for numerical approximation of lower bounds of structured singular value
- Robust stability and performance analysis in the presence of LTI and LTV uncertainties with bounded rates of variation
- Delay margin analysis of uncertain linear control systems using probabilistic
- A gain-based lower bound algorithm for real and mixed problems
- A Popov criterion for networked systems
This page was built for publication: Computing bounds for the mixed μ problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4853401)