Please use this identifier to cite or link to this item: http://hdl.handle.net/10071/5699
Author(s): Laureano, R.
Mendes, D. A.
Ferreira, M. A. M.
Editor: Kovacova, M.
Date: 2007
Title: Efficient synchronization with chaotic quadratic maps
Book title/volume: 6th International Conference Aplimat 2007
Pages: 215 - 224
Event title: 6thInternational Conference Aplimat
Reference: Laureano, R., Mendes, D. A., & Ferreira, M. A. M. (2007). Efficient synchronization with chaotic quadratic maps. In M. Kovacova (Ed.), 6th International Conference Aplimat 2007 (pp. 215-224). Slovak University of Technology in Bratislava. http://hdl.handle.net/10071/5699
ISBN: 978-809695625-8
Abstract: We present a systematic way to design unidirectional and bidirectional coupling schemes for synchronizing arbitrary pairs of (identical or different) discrete dynamical systems. If the coupled chaotic systems are very similar or identical, using the singular value decomposition, it is possible to suppress the exponential divergence of the dynamics of the synchronization error, and exploit the existing contraction properties of the given systems. When non-identical systems are coupled, in order to achieve synchronization it is necessary to employ some other techniques from linear algebra, stability theory and control. We use two methods to study the stability of synchronous state: the linear stability and the Lyapunov functional analysis. In order to illustrate these methods, we use a system of two coupled chaotic quadratic maps. The map obtained by coupling exhibits a richer dynamics that the single quadratic map, but is still possible to study its behaviour.
Peerreviewed: yes
Access type: Open Access
Appears in Collections:DM-CRI - Comunicações a conferências internacionais

Files in This Item:
File SizeFormat 
conferenceObject_12500.pdf394,17 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis Logotipo do Orcid 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.