By Topic

Time complexity and model complexity of fast identification of continuous-time LTI systems

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

3 Author(s)
Lin, L. ; MPD Technols. Inc., Hauppage, NY, USA ; Le Yi Wang ; Zames, G.

The problem of fast identification of continuous-time systems is formulated in the metric complexity theory setting. It is shown that the two key steps to achieving fast identification, i.e., optimal input design and optimal model selection, can be carried out independently when the true system belongs to a general a priori set. These two optimization problems can be reduced to standard Gel'fand and Kolmogorov n-width problems in metric complexity theory. It is shown that although arbitrarily accurate identification can be achieved on a small time interval by reducing the noise-signal ratio and designing the input carefully, identification speed is limited by the metric complexity of the a priori uncertainty set when the noise/signal ratio is fixed

Published in:

Automatic Control, IEEE Transactions on  (Volume:44 ,  Issue: 10 )