Close category search window
 

A note on computing polynomial filters for robust SPR of systems with polyhedral uncertainty

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

1 Author(s)
Bianchini, G. ; Dipt. di Ingegneria dell''Inf., Siena Univ., Italy

This paper addresses the robust strict positive realness (RSPR) problem when the uncertain polynomial family is defined by an l ball in coefficient space. A new characterization of the filters solving such problem is proposed. This characterization is exploited numerically to devise polynomial filters with guaranteed l robustness margin.

Published in:
Decision and Control, 2003. Proceedings. 42nd IEEE Conference on  (Volume:5 )

Date of Conference: 9-12 Dec. 2003

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.