Search

As power systems becoming more closely interconnected and are being deregulated in energy markets, distributed simulations among different dispatch centers are highly required for online full system analysis and control applications. In this paper a new algorithm for distributed transient stability simulation of interconnected power systems is presented. Based on a Jacobian-free Newton-GMRES(m) method, this algorithm requires only exchanges of states of boundary buses among different regions. Therefore, it has strong scalability in distributed computing environments built on heterogeneous computing resources. Moreover, several accelerating methods are developed to enhance its efficiency, including continuous preconditioning with adaptive preconditioners, predicting boundary conditions and multistep coordination. The standard IEEE 39-bus system and a real power system with 1165 buses were used as test systems. The test results show that these accelerating methods greatly enhance the convergence rate of the proposed algorithm and reduce communication costs remarkably, which proves the novel algorithm is feasible and can be adopted in wide area networks with high-latency. [ABSTRACT FROM AUTHOR]

Standard computations reveal that locational marginal prices (LMPs), being Lagrange multipliers in an optimization problem, must lie in the null space of a Jacobian matrix evaluated at the optimal power flow solution, augmented by columns associated with active line flow limits. The impact of network power flow and active line limit constraints is to confine the LMPs in a subspace that satisfies necessary conditions for optimality. Optimal market clearing can then proceed as a minimization over offer curves confined to admissible LMPs in this subspace. When no line limits are active and losses neglected (e.g., in a dc power flow representation), the matrix in question has a generalized Laplacian structure, and admits only a vector of all equal elements in its null space (verifying the well-known equal incremental cost condition). As line flow limits become active, the null space grows in dimension. Among the phenomena of interest as the dimension of admissible LMPs grows is that of "load pockets"; that is, admissible LMP vectors that can show patterns in which buses partition into zones of approximately equal LMPs, with significant differences between zones. This paper explores an approach to admissible LMP calculation that isolates the topological role of active line flow constraints, independent of offer curve prices. Identification of this admissible subspace can then greatly facilitate computations such as clustering to identify potential zones of differentiated LMPs. [ABSTRACT FROM AUTHOR]

This paper describes a methodology to identify potential conflicts among power flow control devices that may slow down or impair convergence. The proposed methodology is based on the eigenvalue analysis of the sparse Jacobian matrix associated with the Newton power flow with controls. Practically identical results are obtained from a smaller control sensitivity matrix. The implementation in a power flow program has been tested using both small- and large-scale systems. The results presented validate and clearly indicate the effectiveness of the proposed technique. [ABSTRACT FROM AUTHOR]