Abstract
The synchronization problem for both continuous and discrete‐time complex dynamical networks with time‐varying delays is investigated. Using optimal partitioning method, time‐varying delays are partitioned into l subintervals and generalized 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 to illustrate the effectiveness and advantage of the proposed synchronization criteria. © 2014 Wiley Periodicals, Inc. Complexity 21: 193–210, 2015
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
