ASYMPTOTIC SYNCHRONIZATION OF CONTINUOUS/DISCRETE COMPLEX DYNAMICAL NETWORKS BY OPTIMAL PARTITIONING METHOD

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2248

Full metadata record

DC Field	Value	Language
dc.contributor.author	R, Rakkiyappan	-
dc.contributor.author	R, Sasirekha	-
dc.date.accessioned	2020-10-17T09:07:28Z	-
dc.date.available	2020-10-17T09:07:28Z	-
dc.date.issued	2015	-
dc.identifier.issn	Print:1076-2787	-
dc.identifier.issn	Online:1099-0526	-
dc.identifier.uri	https://doi.org/10.1002/cplx.21597	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/2248	-
dc.description.abstract	The synchronization problem for both continuous and discrete time complex dynamical networks (CDNs) with time-varying delays is investigated. Usingoptimal partitioning method, time-varying delays are partitioned into l subintervalsand generalised results are derived in terms of Linear matrix inequalities (LMIs).New delay-dependent synchronization criteria in terms of LMIs are derived by constructing appropriate Lyapunov-Krasovskii functional, reciprocally convex combination technique and some inequality techniques. Numerical examples are given toillustrate the effectiveness and advantage of the proposed synchronization criteria.	en_US
dc.language.iso	en	en_US
dc.publisher	Complexity byWiley Online Library	en_US
dc.subject	asymptotic synchronization	en_US
dc.subject	time-varying delays	en_US
dc.subject	optimal partitioning	en_US
dc.subject	reciprocal convex combi nation	en_US
dc.subject	complex dynamical networks	en_US
dc.title	ASYMPTOTIC SYNCHRONIZATION OF CONTINUOUS/DISCRETE COMPLEX DYNAMICAL NETWORKS BY OPTIMAL PARTITIONING METHOD	en_US
dc.type	Article	en_US
Appears in Collections:	International Journals

Files in This Item:

File	Description	Size	Format
ASYMPTOTIC SYNCHRONIZATION OF CONTINUOUSDISCRETE COMPLEX DYNAMICAL NETWORKS BY OPTIMAL PARTITIONING METHOD.docx		10.34 kB	Microsoft Word XML	View/Open