New algorithms for upper and lower bounds on the mixed/real structured singular value

M. J. Hayes, D. G. Bates, A. M. Holohan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

New algorithms are presented for the computation of good upper and lower bounds on the structured singular value μ, for high order plants subject to purely real or mixed real/complex uncertainty. A geometric form of the Hahn-Banach theorem is used to develop an algorithm for computing an upper bound on μ, involving a linear program and a symmetric eigenvalue problem at each iteration. A proof of convergence to a convex upper bound on μ is presented. The new lower bound algorithm formulates the search for a worst-case real (or mixed) destabilising perturbation as a constrained non-linear optimisation problem. The new algorithms are compared with currently available software tools for computing μ on a large scale stability robustness analysis problem for an experimental V/STOL aircraft configuration.

Original languageEnglish
Title of host publication2001 European Control Conference, ECC 2001
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1295-1302
Number of pages8
ISBN (Electronic)9783952417362
DOIs
Publication statusPublished - 2001
Event6th European Control Conference, ECC 2001 - Porto, Portugal
Duration: 4 Sep 20017 Sep 2001

Publication series

Name2001 European Control Conference, ECC 2001

Conference

Conference6th European Control Conference, ECC 2001
Country/TerritoryPortugal
CityPorto
Period4/09/017/09/01

Keywords

  • Optimisation
  • Robustness Analysis

Fingerprint

Dive into the research topics of 'New algorithms for upper and lower bounds on the mixed/real structured singular value'. Together they form a unique fingerprint.

Cite this