Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/2248
Title: | ASYMPTOTIC SYNCHRONIZATION OF CONTINUOUS/DISCRETE COMPLEX DYNAMICAL NETWORKS BY OPTIMAL PARTITIONING METHOD |
Authors: | R, Rakkiyappan R, Sasirekha |
Keywords: | asymptotic synchronization time-varying delays optimal partitioning reciprocal convex combi nation complex dynamical networks |
Issue Date: | 2015 |
Publisher: | Complexity byWiley Online Library |
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. |
URI: | https://doi.org/10.1002/cplx.21597 http://localhost:8080/xmlui/handle/123456789/2248 |
ISSN: | Print:1076-2787 Online:1099-0526 |
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 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.