A gain-based lower bound algorithm for real and mixed µ problems

Authors:
Pete Seiler;Andrew Packard;Gary J. Balas
Affiliations:
Department of Aerospace Engineering and Mechanics, University of Minnesota, 55455-0153, USA;Department of Mechanical Engineering, University of California, Berkeley, 94720-1740, USA;Department of Aerospace Engineering and Mechanics, University of Minnesota, 55455-0153, USA
Venue:
Automatica (Journal of IFAC)
Year:
2010

Citing 8
Cited 0

Topics in matrix analysis

Topics in matrix analysis
The Art of Electronics

The Art of Electronics
Robustness margin need not be a continuous function of the problem data

Systems & Control Letters
The componentwise distance to the nearest singular matrix

SIAM Journal on Matrix Analysis and Applications
The complex structured singular value

Automatica (Journal of IFAC) - Special issue on robust control
Structured singular values and stability analysis of uncertain polynomials, part 1: the generalized &mgr;

Systems & Control Letters
Structured singular values and stability analysis of uncertain polynomials, part 2: a missing link

Systems & Control Letters
The rank one mixed &mgr; problem and “Kharitonov-type” analysis

Automatica (Journal of IFAC)

Quantified Score

Hi-index	22.14

Visualization

Abstract

A new lower bound algorithm for real and mixed @m 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 @m problems of small to moderate size.