Abstract
This paper studies asymptotic properties of /spl Hscr//sub /spl infin// identification problems and algorithms. The sample complexity of time- and frequency-domain /spl Hscr//sub /spl infin// identification problems is estimated, which exhibits a polynomial growth requirement on the input observation duration for the time-domain /spl Hscr//sub /spl infin// identification problem, and a linear growth rate of frequency response samples required for the frequency-domain /spl Hscr//sub /spl infin// identification problem. The divergence behavior is also established for linear algorithms for the time- and frequency-domain problems. The results extend previous work to more restricted sets of linear time-invariant systems with more refined a priori information, specifically imposed on the stability degree and the steady-state gain of the systems, thus demonstrating that no robustly convergent linear algorithms can exist even for a small set of exponentially stable systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
