Abstract
The paper investigates the problem of finite-time projective synchronization between two different complex networks, where two complex networks may be different in the node dynamics, or in the topological structures. By using a finite-time stability theorem and inequality techniques, a sufficient criterion is derived based on Lyapunov stability theory, in the form of linear matrix inequalities (LMIs). The LMIs are readily solved by the LMI toolbox in Matlab. At last, a numerical example is given to illustrate the feasibility and effectiveness of the proposed method. It is worth noting that the coupling configuration matrix is not necessarily symmetric or irreducible; and the inner coupling matrix does not need to be symmetric.
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.
