A class of algorithms for identification in H∞
A class of algorithms for the problem of system identification in H∞ is investigated. These algorithms are characterized by a two-stage structure and involve a class of window functions. Some conditions in terms of properties of the window functions are derived, which guarantee robust convergence of the algorithms. Identification errors are analyzed for several common window functions. This leads to some insights into the trade-off between the error induced by approximation and that due to noise.
Publication Source (Journal or Book title)
Proceedings of the IEEE Conference on Decision and Control
Gu, G., & Khargonekar, P. (1992). A class of algorithms for identification in H∞. Proceedings of the IEEE Conference on Decision and Control, 634-639. Retrieved from https://digitalcommons.lsu.edu/eecs_pubs/398