Please use this identifier to cite or link to this item:
|Title:||Complexity issues in synchronisation||Authors:||Mareels, I.||Keywords:||Complexity issues
Global Newton method
|Issue Date:||2001||Citation:||Mareels, I. (2001). Complexity issues in synchronisation. Proceedings of the IEEE Conference on Decision and Control 1 : 710-715. ScholarBank@NUS Repository.||Abstract:||In this paper, we look at synchronization over a finite window of data from a computational complexity point of view. The setting is purely in discrete time. It is shown that for polynomial systems the computational complexity of a readily available global Newton algorithm adapted to identify the finite trajectory of the dynamical system's state over the observation window scales in a polynomial manner in the dimension of the system state and the degree of the polynomials required to describe the models. Moreover, this algorithm has good robustness properties with respect to measurement errors and model errors. Simulation results are included.||Source Title:||Proceedings of the IEEE Conference on Decision and Control||URI:||http://scholarbank.nus.edu.sg/handle/10635/69663||ISSN:||01912216|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 20, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.