Structured singular values and stability analysis of uncertain polynomials. I: The generalized
Structured singular values and stability analysis of uncertain polynomials. I: The generalized \(\mu\)
This paper contains an early development to a second companion paper by the authors [ibid., No. 2, 97-109 (1994; Zbl 0826.93054)]. A generalized structured singular value with respect to mixed real and complex uncertainties is introduced and an analytical expression for rank-one matrices is derived. The result, applicable to a wide class of norms, involves solving a convex optimization problem in one real variable, rendering the structured singular value readily solvable. The expression can be solved explicitly by performing a finite number of evaluations for specific norms (fairly general) and an optimization procedure is not necessary.
- A dual result to Kharitonov's theorem
- A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
- An M-matrix and majorant approach to robust stability and performance analysis for systems with structured uncertainty
- Characterization and efficient computation of the structured singular value
- Exact calculation of the multiloop stability margin
- scientific article; zbMATH DE number 4207939 (Why is no real title available?)
- scientific article; zbMATH DE number 3636452 (Why is no real title available?)
- Matrix Analysis
- Necessary and sufficient conditions for quadratic stabilizability of an uncertain system
- Parameter space methods for robust control design: a guided tour
- Parametric uncertainty and unmodeled dynamics: Analysis via parameter space methods
- Robust stability of feedback control systems with uncertain parameters and unmodeled dynamics
- Robust stability under structured and unstructured perturbations
- Root locations of an entire polytope of polynomials: It suffices to check the edges
- Structured singular values and stability analysis of uncertain polynomials. II: A missing link
- The complex structured singular value
- Nearest common root of a set of polynomials: a structured singular value approach
- A unified approach to computing the nearest complex polynomial with a given zero
- Computational complexity of real structured singular value in \(\ell_p\) setting
- Complex structured singular value analysis using fixed-structure dynamicD-scales
- Computation of the real structured singular value via pole migration
- Principal direction alignment: a geometric framework for the complete solution to the μ-problem
- m-form numerical range and the computation of the structured singular value
- Approximate zero polynomials of polynomial matrices and linear systems
- Calculation of the structured singular value with a reduced number of optimization variables
- scientific article; zbMATH DE number 4123167 (Why is no real title available?)
- Robustness analysis for systems with ellipsoidal uncertainty
- An adaptive angular sweep algorithm for value set construction
- Structured singular value of implicit systems
- A novel iterative method to approximate structured singular values
- Structured singular values with nondiagonal structures. I. Characterizations
- The nearest complex polynomial with a zero in a given complex domain
- Exact solution for the rank-one structured singular value with repeated complex full-block uncertainty
- On structured singular values of reciprocal matrices
- A gain-based lower bound algorithm for real and mixed problems
- Numerical algorithms for the largest structured singular value of a \(\mu\)-synthesis control system
This page was built for publication: Structured singular values and stability analysis of uncertain polynomials. I: The generalized \(\mu\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333849)
