Abstract
Local and global synchronization of complex dynamical networks are studied in this paper. Some simple yet generic criteria ensuring delay-independent and delay-dependent synchronization are derived in terms of linear matrix inequalities (LMIs), which can be verified easily via interior-point algorithm. The assumption that the coupling configuration matrix is symmetric and irreducible, which is frequently used in other literatures, is removed. A network with a fixed delay and a special coupling scheme is given as an example to illustrate the theoretical results and the effectiveness of the proposed synchronization scheme.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have