.png){kind=icon}
.png){kind=icon}
Return
A gain-based lower bound algorithm for real and mixed μ problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2009.12.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new lower bound algorithm for real and mixed mu problems is presented. The basic idea of this algorithm is to use a related worst-case gain problem to compute the real blocks and, if the block structure is mixed, the standard power iteration to compute the complex blocks. Numerical tests indicate that the algorithm is fast and provides good lower bounds for both real and mixed mu problems of small to moderate size. (C) 2009 Elsevier Ltd. All rights reserved.
Keywords:
Structured singular value
Robust stability
Uncertain linear systems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.