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

Peter J Seiler Jr, Andrew Packard, Gary Balas

Research output: Contribution to journalArticle

17 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)493-500
Number of pages8
JournalAutomatica
Volume46
Issue number3
DOIs
StatePublished - Mar 1 2010

Keywords

  • Robust stability
  • Structured singular value
  • Uncertain linear systems

Cite this

A gain-based lower bound algorithm for real and mixed μ problems. / Seiler Jr, Peter J; Packard, Andrew; Balas, Gary.

In: Automatica, Vol. 46, No. 3, 01.03.2010, p. 493-500.

Research output: Contribution to journalArticle

Seiler Jr, Peter J ; Packard, Andrew ; Balas, Gary. / A gain-based lower bound algorithm for real and mixed μ problems. In: Automatica. 2010 ; Vol. 46, No. 3. pp. 493-500.
@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 = "3",
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

VL - 46

SP - 493

EP - 500

JO - Automatica

JF - Automatica

SN - 0005-1098

IS - 3

ER -