Worst Case FIR Approximations in H-infinity.
Date P. and Vinnicombe G.
Proceedings of European Control Conference, August 1999Abstract
This paper considers a robustly convergent algorithm for worst case identification using FIR models. A new and stronger notion of robust convergence is established, and error bounds are obtained for a fixed model order as the length of data tends to infinity. The algorithm is shown to be implementable as a solution to an LMI optimisation problem. A robustly convergent algorithm for identification of plant coprime factors is suggested. An iterative technique for identification in the nugap metric is given. Two simulation examples demonstrate the use of these algorithms.
BibTex Entry
- @InProceedings{,
- author = {Date P. and Vinnicombe G.},
- title = {Worst Case FIR Approximations in H-infinity. },
- address = {Karlsruhe, Germany},
- booktitle = {Proceedings of European Control Conference},
- month = {August},
- year = {1999}
- }
|
![[Dept of Engineering]](http://www.eng.cam.ac.uk/images/house_style/engban-s.gif)
