Cart (Loading....) | Create Account
Close category search window
 

On H model reduction using LMIs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ebihara, Y. ; Dept. of Electr. Eng., Kyoto Univ., Japan ; Hagiwara, T.

In this note, we deal with the problem of approximating a given nth-order linear time-invariant system G by an rth-order system Gr where r∞ norm of the associated error system can be analyzed by using linear matrix ineqaulity (LMI)-related techniques. These lower bounds are given in terms of the Hankel singular values of the system G and coincide with those obtained in the previous studies where the analysis of the Hankel operators plays a central role. Thus, this note provides an alternative proof for those lower bounds via simple algebraic manipulations related to LMIs. Moreover, when we reduce the system order by the multiplicity of the smallest Hankel singular value, we show that the problem is essentially convex and the optimal reduced-order models can be constructed via LMI optimization.

Published in:

Automatic Control, IEEE Transactions on  (Volume:49 ,  Issue: 7 )

Date of Publication:

July 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.