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

Author

Chow, Joe H. ; Date, Ranjit

Author_Institution

Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA

fYear

1988

fDate

7-9 June 1988

Firstpage

669

Abstract

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.<>

Keywords

power system analysis computing; transmission network calculations; aggregation process; linearized power system networks; linearized two-time-scale power networks; nodal aggregation algorithm; nodal elimination algorithm; recursive formulas; recursive two-node aggregations; slow aggregate; sparsity; Aggregates; Computer networks; Frequency; Jacobian matrices; Perturbation methods; Power engineering and energy; Power engineering computing; Power system dynamics; Power system modeling; Systems engineering and theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1988., IEEE International Symposium on

Conference_Location

Espoo, Finland

Type

conf

DOI

10.1109/ISCAS.1988.15014

Filename

15014