Approximating the real structured stability radius with Frobenius-norm bounded perturbations

From MaRDI portal
Publication:4598332

DOI10.1137/16M1110169zbMATH Open1379.65040arXiv1702.02486MaRDI QIDQ4598332FDOQ4598332


Authors: Mert Gürbüzbalaban, Tim Mitchell, Michael L. Overton, Nicola Guglielmi Edit this on Wikidata


Publication date: 20 December 2017

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Abstract: We propose a fast method to approximate the real stability radius of a linear dynamical system with output feedback, where the perturbations are restricted to be real valued and bounded with respect to the Frobenius norm. Our work builds on a number of scalable algorithms that have been proposed in recent years, ranging from methods that approximate the complex or real pseudospectral abscissa and radius of large sparse matrices (and generalizations of these methods for pseudospectra to spectral value sets) to algorithms for approximating the complex stability radius (the reciprocal of the Hinfty norm). Although our algorithm is guaranteed to find only upper bounds to the real stability radius, it seems quite effective in practice. As far as we know, this is the first algorithm that addresses the Frobenius-norm version of this problem. Because the cost mainly consists of computing the eigenvalue with maximal real part for continuous-time systems (or modulus for discrete-time systems) of a sequence of matrices, our algorithm remains very efficient for large-scale systems provided that the system matrices are sparse.


Full work available at URL: https://arxiv.org/abs/1702.02486




Recommendations




Cites Work


Cited In (6)

Uses Software





This page was built for publication: Approximating the real structured stability radius with Frobenius-norm bounded perturbations

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