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

Peter J Seiler Jr; Andrew Packard; Gary Balas

doi:10.1016/j.automatica.2009.12.008

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

Peter J Seiler Jr, Andrew Packard, Gary Balas

Aerospace Engineering and Mechanics

Research output: Contribution to journal › Article › peer-review

26 Scopus citations

Abstract

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

Original language	English (US)
Pages (from-to)	493-500
Number of pages	8
Journal	Automatica
Volume	46
Issue number	3
DOIs	https://doi.org/10.1016/j.automatica.2009.12.008
State	Published - Mar 1 2010

Keywords

Robust stability
Structured singular value
Uncertain linear systems

Access

10.1016/j.automatica.2009.12.008

OpenUrl availability

Full text

Cite this

@article{37d85a31f9f64c54a9c6f448098b0ba3,

title = "A gain-based lower bound algorithm for real and mixed μ problems",

abstract = "A new lower bound algorithm for real and mixed μ 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 μ problems of small to moderate size.",

keywords = "Robust stability, Structured singular value, Uncertain linear systems",

author = "{Seiler Jr}, {Peter J} and Andrew Packard and Gary Balas",

year = "2010",

month = mar,

day = "1",

doi = "10.1016/j.automatica.2009.12.008",

language = "English (US)",

volume = "46",

pages = "493--500",

journal = "Automatica",

issn = "0005-1098",

publisher = "Elsevier Limited",

number = "3",

}

TY - JOUR

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

AU - Seiler Jr, Peter J

AU - Packard, Andrew

AU - Balas, Gary

PY - 2010/3/1

Y1 - 2010/3/1

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

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

KW - Robust stability

KW - Structured singular value

KW - Uncertain linear systems

UR - http://www.scopus.com/inward/record.url?scp=77549085668&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77549085668&partnerID=8YFLogxK

U2 - 10.1016/j.automatica.2009.12.008

DO - 10.1016/j.automatica.2009.12.008

M3 - Article

AN - SCOPUS:77549085668

SN - 0005-1098

VL - 46

SP - 493

EP - 500

JO - Automatica

JF - Automatica

IS - 3

ER -

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

Abstract

Keywords

Access

OpenUrl availability

Other files and links

Cite this