Papers
Topics
Authors
Recent
Search
2000 character limit reached

Graph-based Preconditioning Conjugate Gradient Algorithm for N-1 Contingency Analysis

Published 8 Mar 2018 in cs.DC, cs.DS, cs.NA, and math.NA | (1803.03290v1)

Abstract: Contingency analysis (CA) plays a critical role to guarantee operation security in the modern power systems. With the high penetration of renewable energy, a real-time and comprehensive N-1 CA is needed as a power system analysis tool to ensure system security. In this paper, a graph-based preconditioning conjugate gradient (GPCG) approach is proposed for the nodal parallel computing in N-1 CA. To pursue a higher performance in the practical application, the coefficient matrix of the base case is used as the incomplete LU (ILU) preconditioner for each N-1 scenario. Additionally, the re-dispatch strategy is employed to handle the islanding issues in CA. Finally, computation performance of the proposed GPCG approach is tested on a real provincial system in China.

Citations (15)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.