Please use this identifier to cite or link to this item:
|Title:||Algorithms for worst case identification in H-infinity and the nu-gap metric|
|Keywords:||Robust identification;Identification for control;ν-gap metric|
|Citation:||Automatica, 40: 995-1002, Mar 2004|
|Abstract:||This paper considers two robustly convergent algorithms for the identification of a linear system from (possibly) noisy frequency response data. Both algorithms are based on the same principle; obtaining a good worst case fit to the data under a smoothness constraint on the obtained model. However they differ in their notions of distance and smoothness. The first algorithm yields an FIR model of a stable system and is optimal, in a certain sense for a finite model order. The second algorithm may be used for modelling unstable plants and yields a real rational approximation in the -gap. Given a model and a controller stabilising the true plant, a procedure for winding number correction is also suggested.|
|Appears in Collections:||Computer Science|
Dept of Mathematics Research Papers
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.