Abstract
We show that 2-norm pseudospectra of m-by-n matrices have no more than 2m(4m-1) connected components. Such bounds are pertinent for computing the distance to uncontrollability of a control system, since this distance is the minimum value of a function whose level sets are pseudospectra. We also discuss algorithms for computing this distance, including a trisection variant of Gu's recent algorithm, and we show how these may be used to locally maximize the distance to uncontrollability for a parameterized system.
Original language | English (US) |
---|---|
Pages (from-to) | 350-361 |
Number of pages | 12 |
Journal | SIAM Journal on Matrix Analysis and Applications |
Volume | 26 |
Issue number | 2 |
DOIs | |
State | Published - 2005 |
Keywords
- Connected components
- Distance to uncontrollability
- Pseudospectrum
- Robust control
- Trisection
ASJC Scopus subject areas
- Analysis