Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/491
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Date, P | - |
dc.contributor.author | Vinnicombe, G | - |
dc.coverage.spatial | 8 | en |
dc.date.accessioned | 2007-01-03T10:45:41Z | - |
dc.date.available | 2007-01-03T10:45:41Z | - |
dc.date.issued | 2004 | - |
dc.identifier.citation | Automatica, 40: 995-1002, Mar 2004 | en |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/491 | - |
dc.description.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. | en |
dc.format.extent | 501717 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Elsevier Science | en |
dc.subject | Robust identification | en |
dc.subject | Identification for control | en |
dc.subject | ν-gap metric | en |
dc.title | Algorithms for worst case identification in H-infinity and the nu-gap metric | en |
dc.type | Research Paper | en |
dc.identifier.doi | http://dx.doi.org/10.1016/j.automatica.2004.01.019 | - |
Appears in Collections: | Computer Science Dept of Mathematics Research Papers Mathematical Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
algorithms_for.pdf | 489.96 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.