A numerical method for computing the structured singular value

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Controllability (93B05)

Review text

The article is devoted to a numerical testing procedure for the robustness of systems whose performances can be expressed as \(\| F(z)\|\), where \(z\in M_{tr}\) contains uncertain parameters and for given matrices \(a\in M_{lk}\), \(b\in M_{lt}\), \(c\in M_{rk}\), \(d\in M_{rt}\), F is defined as \[ F_{\left( \begin{matrix} a\quad b\\ c\quad d\end{matrix} \right)}(z)=a+bz(I+dz)^{-1}c. \] The plant uncertainty problem is to verify if for given \(\left( \begin{matrix} a\quad b\\ c\quad d\end{matrix} \right)\) a simplex \(\Omega \subset M_{tr}\) and \(\rho >0\) the inequality \(\| F_{\left( \begin{matrix} a\quad b\\ c\quad d\end{matrix} \right)}(z)\| <\rho\) remains true for all \(z\in \Omega\). The proposed algorithm is based on transforming the initial problem in two subproblems: the first step is equivalent to a quadratic programming approach and the second needs to find the highest eigenvalue of a matrix.

Recommendations

Cites work

Cited in

(18)

This page was built for publication: A numerical method for computing the structured singular value

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107957)