By Topic

Set membership approach for reducing value sets in the frequency domain

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

3 Author(s)
Rotstein, H. ; Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel ; Galperin, N. ; Gutman, P.-O.

Previously, several nonparametric robust identification algorithms have been proposed that generate a collection of frequency-dependent value sets where the true model of a linear time-invariant system is assumed to lie. If the system is also assumed to have restricted complexity, then the identified value sets may be conservative. The purpose of this paper is to investigate this problem of conservativeness from a set membership viewpoint and propose an algorithm for computing the largest value sets contained in the original ones that can be generated by a model of fixed structure but unknown parameters

Published in:

Automatic Control, IEEE Transactions on  (Volume:43 ,  Issue: 9 )