By Topic

The Caratheodory-Fejer problem and H/l1 identification: a time domain approach

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

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)
Jie Chen ; Coll. of Eng., California Univ., Riverside, CA, USA ; Nett, C.N.

In this paper we study a worse-case, robust control oriented identification problem. This problem is in the framework of H identification, but the formulation here is more general. The available a priori information in our problem consists of a lower bound on the relative stability of the plant, an upper bound on a certain gain associated with the plant, and an upper bound on the noise level. The plant to be identified is assumed to lie in a certain subset in the space of H, characterized by the assumed a priori information. The available experimental information consists of a corrupt finite output time series obtained in response to a known nonzero but otherwise arbitrary input. The proposed algorithm is in the class of interpolatory algorithms which are known to possess desirable optimality properties in reducing the identification error. This algorithm is obtained by solving an extended Caratheodory-Fejer problem via standard convex programming methods. Both the algorithm and error bounds ran be applied to l1 identification problems as well

Published in:

Automatic Control, IEEE Transactions on  (Volume:40 ,  Issue: 4 )