Many large-scale systems exhibit the structure of weakly connected components. In such cases, proper identification of weakly coupled subsystems will add insight into large-scale system behavior, and aid in related tasks such as the design of decentralized control, @e-decomposition is a well-known efficient graph-theoretic algorithm for achieving a complete set of nested decompositions of a large-scale system. This paper shows how system matrix scaling can affect these decompositions, and determines that a system is properly scaled for @e-decomposition when it is max-balanced, a property associated with weighted directed graphs. Also, it is shown that an existing algorithm for max-balancing can be altered slightly to return the complete set of @e-decompositions, thus removing the need for two separate algorithms. Finally, the advantages of max-balancing before decomposition are shown for the application of decentralized control subsystem identification.
[1]
E. E. Osborne.
On Pre-Conditioning of Matrices
,
1960,
JACM.
[2]
Uriel G. Rothblum,et al.
Characterizations of Max-Balanced Flows
,
1992,
Discret. Appl. Math..
[3]
Robert E. Tarjan,et al.
Depth-First Search and Linear Graph Algorithms
,
1972,
SIAM J. Comput..
[4]
Hans Schneider,et al.
Max-Balancing Weighted Directed Graphs and Matrix Scaling
,
1991,
Math. Oper. Res..
[5]
Frank Harary,et al.
Graph Theory
,
2016
.
[6]
Dragoslav D. Siljak,et al.
Nested ε-decompositions and clustering of complex systems
,
1986,
Autom..
[7]
D. Siljak,et al.
A Block-Parallel Newton Method Via OverlappingEpsilon Decompositions
,
1994
.
[8]
B. S. Heck,et al.
Matrix scaling for large-scale system decomposition
,
1995,
Proceedings of 1995 American Control Conference - ACC'95.