A nodal aggregation algorithm for linearized two-time-scale power networks

A nodel aggregation algorithm has been proposed to compute the slow aggregate of linearized power system networks. The algorithm decomposes the aggregation process into recursive two-node aggregations. Recursive formulas for aggregation are derived, replacing the inversion of a possibly large, dense matrix. To reduce the amount of computation and storage, the algorithm can utilize sparsity in choosing the nodes to be aggregated at each step. The algorithm reduces to the nodal elimination algorithm when one of the nodes to be aggregated is static.<>