Identification for control: Deterministic algorithms and error bounds

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/3066

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Vinnicombe, G	-
dc.contributor.author	Date, Paresh	-
dc.date.accessioned	2009-02-26T16:23:37Z	-
dc.date.available	2009-02-26T16:23:37Z	-
dc.date.issued	2001	-
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/3066	-
dc.description	This thesis was submitted for the degree of Doctor of Philosophy and awarded by the University of Cambridge.	-
dc.description.abstract	This dissertation deals with frequency domain identification of linear dynamic systems in a deterministic set-up. Various untuned algorithms are suggested, including one which is robustly convergent and asymptotically optimal (in n-width sense) for a finite model order. The suggested algorithms can easily be implemented in commercially available software for convex optimization.	en
dc.format.extent	658882 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	University of Cambridge, Department of Engineering	en
dc.relation.uri	http://bura.brunel.ac.uk/bitstream/2438/3066/1/FulltextThesis.pdf	-
dc.subject.other	Robust identification	en
dc.subject.other	Nu-gap metric	en
dc.subject.other	N-width	en
dc.title	Identification for control: Deterministic algorithms and error bounds	en
dc.type	Thesis	-
dc.contributor.sponsor	Cambridge Nehru Trust, CVCP Overseas Research Studentship	en
Appears in Collections:	Dept of Mathematics Theses Mathematical Sciences

Files in This Item:

File	Description	Size	Format
FulltextThesis.pdf		643.44 kB	Adobe PDF	View/Open