(Q, S, R)-Dissipativity Analysis of Large-Scale Networked Systems

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.