By Topic

Worst case system identification in H: validation of a priori information, essentially optimal algorithms, and error bounds

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

Resolves several important open issues pertaining to a worst-case control-oriented system identification problem known as identification in H. First, a method is presented for developing confidence that certain a priori information available for identification is not invalid. This method requires the solution of a certain nondifferentiable convex program. Second, an essentially optimal identification algorithm is constructed. This algorithm is (worst-case strongly) optimal to within a factor of two. Finally, new upper and lower bounds on the optimal identification error are derived and used to estimate the identification error associated with the given algorithm. Interestingly, the development of each of these results draws heavily upon the classical Nevanlinna-Pick interpolation theory. As such, the authors' results establish a clear link between the areas of system identification and optimal interpolation theory. Both the formulation and techniques in this paper are applicable to problems where the frequency data available for identification may essentially be arbitrarily distributed

Published in:

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