Computational study and comparisons of LFT reducibility methods

Carolyn Beck, Raffaello D'Andrea

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A set of computationally tractable model reduction algorithms are described which may be used to determine minimal realization dimensions for uncertain systems represented by linear fractional transformations on structured uncertainty sets; these computational tools are also applicable to multi-dimensional systems. The methods described utilize linear matrix inequality methods, in addition to straightforward coordinate transformations and truncations. These algorithms are evaluated on a variety of example systems that are constructed to be reducible.

Original languageEnglish (US)
Title of host publicationProceedings of the 1998 American Control Conference, ACC 1998
Pages1013-1017
Number of pages5
DOIs
StatePublished - Dec 1 1998
Externally publishedYes
Event1998 American Control Conference, ACC 1998 - Philadelphia, PA, United States
Duration: Jun 24 1998Jun 26 1998

Publication series

NameProceedings of the American Control Conference
Volume2
ISSN (Print)0743-1619

Other

Other1998 American Control Conference, ACC 1998
Country/TerritoryUnited States
CityPhiladelphia, PA
Period6/24/986/26/98

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Computational study and comparisons of LFT reducibility methods'. Together they form a unique fingerprint.

Cite this