Abstract
This paper considers the problem of controlling a complex dynamical network by means of pinning. We point out that the synchronization criterion given in the form of matrix eigenvalues can be equivalent to a linear matrix inequality criterion. We further investigate network synchronization via pinning and prove several linear matrix inequality theorems. In particular, we theoretically provide two typical pinning strategies based on whether the graph which is made up of unpinned nodes and edges between them is irreducible or not. Numerical simulations including k-regular networks, star-shaped networks and BA scale-free networks, are shown for illustration and verification.
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 callMore From: Journal of Physics A: Mathematical and Theoretical
Disclaimer: 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.
