Suboptimal Model Reduction using LMIs with Convex Constraints
2006 (English)Report (Other academic)
An approach to model reduction of LTI systems using Linear Matrix Inequalities (LMIs) in an H-infinity framework is presented, where non-convex constraints are replaced with stricter convex constraints thus making it suboptimal. The presented algorithms are compared with the Optimal Hankel reduction algorithm, and are shown to achieve better results (i.elower H-infinity errors) in cases where some of the Hankel singular values are close, but not equal to each other.
Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2006. , 10 p.
LiTH-ISY-R, ISSN 1400-3902 ; 2759
Model reduction, Linear systems, LMIs
IdentifiersURN: urn:nbn:se:liu:diva-56111ISRN: LiTH-ISY-R-2759OAI: oai:DiVA.org:liu-56111DiVA: diva2:316818