On the real stability radius of sparse systems
From MaRDI portal
Abstract: In this paper, we study robust stability of sparse LTI systems using the stability radius (SR) as a robustness measure. We consider real perturbations with an arbitrary and pre-specified sparsity pattern of the system matrix and measure their size using the Frobenius norm. We formulate the SR problem as an equality-constrained minimization problem. Using the Lagrangian method for optimization, we characterize the optimality conditions of the SR problem, thereby revealing the relation between an optimal perturbation and the eigenvectors of an optimally perturbed system. Further, we use the Sylvester equation based parametrization to develop a penalty based gradient/Newton descent algorithm which converges to the local minima of the optimization problem. Finally, we illustrate how our framework provides structural insights into the robust stability of sparse networks.
Recommendations
- Approximating real stability radii
- Approximating the real structured stability radius with Frobenius-norm bounded perturbations
- Robustness measures for linear systems with application to stability radii of Hurwitz and Schur polynomials
- scientific article; zbMATH DE number 4079286
- Sparse stable systems
Cites work
- scientific article; zbMATH DE number 3920686 (Why is no real title available?)
- scientific article; zbMATH DE number 176451 (Why is no real title available?)
- scientific article; zbMATH DE number 1261669 (Why is no real title available?)
- scientific article; zbMATH DE number 934504 (Why is no real title available?)
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
- A bisection method for computing the \(H_{\infty}\) norm of a transfer matrix and related problems
- A fast algorithm to compute the \(H_{\infty}\)-norm of a transfer function matrix
- A formula for computation of the real stability radius
- A new approach for calculating the real stability radius
- A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its \(L_{\infty}\)-norm
- An algorithm for the computation of the structured complex stability radius
- An easily computable estimate for the real unstructured F-stability radius
- Approximating real stability radii
- Approximating the real structured stability radius with Frobenius-norm bounded perturbations
- Complex-Valued Matrix Differentiation: Techniques and Key Results
- Distance problems for linear dynamical systems
- Estimates of the real structured radius of stability of linear dynamic systems
- Linear and nonlinear programming.
- Low-rank dynamics for computing extremal points of real pseudospectra
- Mathematical Systems Theory I
- New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices
- On the method by Rostami for computing the real stability radius of large and sparse matrices
- Pole assignment via Sylvester's equation
- Stability radii of linear systems
- Stability radius for structured perturbations and the algebraic Riccati equation
- The Structured Distance to the Nearest System Without Property $\mathcal {P}$
- The stability robustness determination of state space models with real unstructured perturbations
Cited in
(5)- On the real stability radius for some classes of matrices
- On real structured controllability/stabilizability/stability radius: complexity and unified rank-relaxation based methods
- Stability radius and dichotomy radius of infinite-dimensional linear systems under unbounded perturbations via Yosida distance
- Subspace method for the estimation of large-scale structured real stability radius
- Sparse stable systems
This page was built for publication: On the real stability radius of sparse systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2173905)
