DocumentCode
329593
Title
Implementation of balanced realization algorithms in a symbolic environment
Author
Baki, H. ; Munro, N.
Author_Institution
Control Syst. Centre, Univ. of Manchester Inst. of Sci. & Technol., UK
fYear
1998
fDate
1-4 Sep 1998
Firstpage
1317
Abstract
Calculation of controllability and observability Gramians, and the determination of balanced realizations are considered in a symbolic framework. Two different approaches to balancing transformations are explained step by step, and more efficient, simple and numerically stable algorithms based on these two approaches have been implemented. An example taken from the literature is presented in order to illustrate the superiority of the symbolic implementations
Keywords
controllability; Gramians; balanced realization algorithms; controllability; eigenstructure; model order reduction; observability; singular value decomposition; symbolic algebra;
fLanguage
English
Publisher
iet
Conference_Titel
Control '98. UKACC International Conference on (Conf. Publ. No. 455)
Conference_Location
Swansea
ISSN
0537-9989
Print_ISBN
0-85296-708-X
Type
conf
DOI
10.1049/cp:19980420
Filename
726110
Link To Document