z-logo
open-access-imgOpen Access
Decomposition approach to exponential synchronisation for a class of non‐linear singularly perturbed complex networks
Author(s) -
Cai Chenxiao,
Wang Zidong,
Xu Jing,
Alsaedi Ahmed
Publication year - 2014
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2014.0102
Subject(s) - kronecker product , mathematics , complex network , exponential function , kronecker delta , matrix decomposition , topology (electrical circuits) , control theory (sociology) , perturbation (astronomy) , linear system , mathematical optimization , computer science , mathematical analysis , combinatorics , eigenvalues and eigenvectors , physics , control (management) , quantum mechanics , artificial intelligence
This study is concerned with the globally exponential synchronisation problem for a class of non‐linear singularly perturbed complex networks where all nodes possess the same structure and properties. The addressed global synchronisation problem is converted into the one for two lower‐order sub‐networks, namely, a non‐linear slow sub‐network and a linear fast sub‐network, which are obtained by using the classical singular perturbation decomposition method. The network topology is directed and weighted, which means that the coupling configuration matrix is allowed to be asymmetric. By using the Lyapunov functional method and the Kronecker product technique, sufficient conditions are obtained under which the synchronisation is achieved, respectively, for the two sub‐networks and the original complex network. These conditions can be easily verified by using the semi‐definite programming method. A numerical example is finally simulated to validate the theoretical results and the effectiveness of the proposed synchronisation scheme.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here