By Topic

A class of algorithms for identification in H: continuous-time case

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
$33 $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)
H. Akcay ; Dept. of Mech. Eng. & Appl. Mech., Michigan Univ., Ann Arbor, MI, USA ; G. Gu ; P. P. Khargonekar

The problem of system identification in H for the continuous-time case is investigated. It is shown that the class of systems with a lower bound on the relative stability, an upper bound on the steady-state gain, and an upper bound on the roll-off rate is admissible. This allows one to develop a class of robustly convergent nonlinear algorithms. The algorithms in this class have a two-stage structure and are characterized by the use of window functions. Explicit worst-case error bounds in H norm between the identified model and the unknown system are given for a particular algorithm. An example is provided to illustrate the application of the results obtained

Published in:

IEEE Transactions on Automatic Control  (Volume:38 ,  Issue: 2 )