Kalman decomposition of linear fractional transformation representations and minimality

Author

D´Andrea, Raffaello ; Khatri, Sven

Author_Institution

Sibley Sch. of Mech. & Aerosp. Eng., Cornell Univ., Ithaca, NY, USA

Volume

6

fYear

1997

fDate

4-6 Jun 1997

Firstpage

3557

Abstract

A method of decomposing systems captured as linear fractional transformations on noncommuting operators into a Kalman type of decomposition is presented. By considering the operators as acting on vector valued discrete time signals, we generalize the standard notions of controllability and observability to the uncertain case. These notions can then be used to establish the minimality of a given representation, and form the basis for tractable algorithms which can be used to construct minimal representations

Keywords

Kalman filters; computational complexity; controllability; discrete time systems; observability; transforms; uncertain systems; Kalman decomposition; controllability; linear fractional transformation representations; minimality; noncommuting operators; observability; tractable algorithms; vector valued discrete time signals; Aerospace engineering; Controllability; Delay; Discrete time systems; Kalman filters; Linear matrix inequalities; Observability; Reduced order systems; Robustness; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

American Control Conference, 1997. Proceedings of the 1997

Conference_Location

Albuquerque, NM

ISSN

0743-1619

Print_ISBN

0-7803-3832-4

Type

conf

DOI

10.1109/ACC.1997.609484

Filename

609484