Change search
ReferencesLink to record
Permanent link

Direct link
Employing Kronecker Canonical Form for H-infinity Synthesis Problems
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
2011 (English)Report (Other academic)
Abstract [en]

The Kronecker canonical form (KCF) can be employed when solving H-infinity synthesis problem. The KCF structure reveals variables that can be eliminated in the semidefinite program that defines the controller. The structure can also be used to remove states in the controller without sacrificing performance. In order to find the KCF structure, we can transform the relevant matrices to a generalized upper triangular (Guptri) form using orthogonal transformations. Thus, we can avoid finding the KCF structure explicitly, which is a badly conditioned problem.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2011. , 21 p.
LiTH-ISY-R, ISSN 1400-3902 ; 3007
Keyword [en]
Controller synthesis, Kronecker canonical form (KCF), Linear matrix inequality (LMI), Model reduction, Semidefinite programming, Singular value decomposition (SVD)
National Category
Control Engineering
URN: urn:nbn:se:liu:diva-97950ISRN: LiTH-ISY-R-3007OAI: diva2:650761
Available from: 2013-09-23 Created: 2013-09-23 Last updated: 2014-08-07Bibliographically approved

Open Access in DiVA

fulltext(753 kB)143 downloads
File information
File name FULLTEXT01.pdfFile size 753 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Helmersson, Anders
By organisation
Automatic ControlThe Institute of Technology
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 143 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 122 hits
ReferencesLink to record
Permanent link

Direct link