### Abstract

Fast parallel algorithms to compute unstable equilibria in the state space of a large electric power system are introduced and analyzed. The approach utilizes cluster separation. The algorithm proposed for finding stable equilibria is novel and is much faster in parallel implementation then the sparse Newton-Raphson technique. The algorithm proposed for finding unstable equilibria is not only novel but is the only available algorithm for computing unstable equilibria. Necessary and sufficient conditions for stability and instability checking have been developed. These conditions give some indications how the (N-1) unstable equilibria can be located through cluster structures. Simulation results are also given to show the convergence of the algorithms. Time-complexity analysis of parallel implementation is described and shows the potential of the algorithms.

Original language | English |
---|---|

Journal | Proceedings of the IEEE Conference on Decision and Control |

Publication status | Published - 1 Dec 1988 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Chemical Health and Safety
- Control and Systems Engineering
- Safety, Risk, Reliability and Quality

### Cite this

**Computational algorithms for unstable and stable (load flow) equilibria of the power system.** / Zheng, B.; Huang, Garng Morton; Zaborszky, J.

Research output: Contribution to journal › Conference article

}

TY - JOUR

T1 - Computational algorithms for unstable and stable (load flow) equilibria of the power system

AU - Zheng, B.

AU - Huang, Garng Morton

AU - Zaborszky, J.

PY - 1988/12/1

Y1 - 1988/12/1

N2 - Fast parallel algorithms to compute unstable equilibria in the state space of a large electric power system are introduced and analyzed. The approach utilizes cluster separation. The algorithm proposed for finding stable equilibria is novel and is much faster in parallel implementation then the sparse Newton-Raphson technique. The algorithm proposed for finding unstable equilibria is not only novel but is the only available algorithm for computing unstable equilibria. Necessary and sufficient conditions for stability and instability checking have been developed. These conditions give some indications how the (N-1) unstable equilibria can be located through cluster structures. Simulation results are also given to show the convergence of the algorithms. Time-complexity analysis of parallel implementation is described and shows the potential of the algorithms.

AB - Fast parallel algorithms to compute unstable equilibria in the state space of a large electric power system are introduced and analyzed. The approach utilizes cluster separation. The algorithm proposed for finding stable equilibria is novel and is much faster in parallel implementation then the sparse Newton-Raphson technique. The algorithm proposed for finding unstable equilibria is not only novel but is the only available algorithm for computing unstable equilibria. Necessary and sufficient conditions for stability and instability checking have been developed. These conditions give some indications how the (N-1) unstable equilibria can be located through cluster structures. Simulation results are also given to show the convergence of the algorithms. Time-complexity analysis of parallel implementation is described and shows the potential of the algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0024175477&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024175477&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0024175477

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

SN - 0191-2216

ER -