Abstract
This brief investigates the (Q,S,R)-dissipativity of large-scale networked systems in the discrete-time case. The networked system consists of a large number of subsystems, each of which can have different dynamic characteristics, and the connections among subsystems are arbitrary. When the number of subsystems is large, the traditional analysis method based on lumped description may have computational difficulties. To solve this problem, some computationally attractive conditions are derived, which essentially depend on the block-diagonal structure of the system parameter matrices and the sparseness of the subsystem connection matrix. Numerical simulations illustrate that compared with the existing results, the conditions suggested in this brief have higher computational efficiency in the dissipative analysis of large-scale networked systems.
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 callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
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.
