liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Employing Kronecker Canonical Form for LMI-Based H-infinity Synthesis Problems
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
2012 (English)In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 57, no 8, 2062-2067 p.Article in journal (Refereed) Published
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
2012. Vol. 57, no 8, 2062-2067 p.
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-84748DOI: 10.1109/TAC.2011.2179846ISI: 000306916900016OAI: diva2:561487
Available from: 2012-10-19 Created: 2012-10-19 Last updated: 2013-07-23

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Helmersson, Anders
By organisation
Automatic ControlThe Institute of Technology
In the same journal
IEEE Transactions on Automatic Control
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
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

Altmetric score

Total: 228 hits
ReferencesLink to record
Permanent link

Direct link