基于改进Jacobian-Free Newton-GMRES(m)的电力系统分布式潮流计算

Distributed Power Flow Calculation Based on an Improved Jacobian-Free Newton-GMRES (m) Method

为了提高互联电网分布式潮流算法的实用性,应尽可能减少协调计算中的交换信息。文中采用隐函数方式表示分布式潮流的边界协调方程,并采用具有自适应预处理能力的NewtonGMRES(m)方法构建分解协调算法。该方法具有Jacobian-Free特性,协调计算中只需要交换边界节点状态信息。以IEEE标准系统和大规模实际系统为算例的测试结果表明,新的分布式潮流算法具有较高的收敛性,数据交换接口简单,实用性强,适合于求解连续变化的分布式潮流问题。

In order to be more applicable and scalable, distributed power flow algorithms are required to utilize only simple and fundamental information such as states of boundary nodes. In this paper, schedule equations of distributed power flows are modeled as a set of implicit nonlinear equations. To solve these equations, an adaptive preconditioned Jacobian-Free Newton- GMRES （m） method is proposed. Based on it, a new distributed power flow algorithm is constructed, which only requires exchanging states of boundary nodes during cooperative computation. Test results of IEEE standard systems and a large real power system show that the proposed distributed power flow algorithm has fast convergence rate. As using simple data interfaces, it can integrate heterogeneous computation resources easily. The continuous preconditioning method makes it more feasible for on-line distributed power flow calculations.