Employing Kronecker Canonical Form for LMI-Based H-infinity Synthesis Problems
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
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.
Controller synthesis, Kronecker canonical form (KCF), Linear matrix inequality (LMI), Model reduction, Semidefinite programming, Singular value decomposition (SVD)
IdentifiersURN: urn:nbn:se:liu:diva-84748DOI: 10.1109/TAC.2011.2179846ISI: 000306916900016OAI: oai:DiVA.org:liu-84748DiVA: diva2:561487