基于网络分块算法的静态安全快速计算方法

发布时间：2018-01-19 21:16

本文关键词： 网络分块算法协调变量故障潮流改进牛拉法弱收敛条件静态安全　出处：《电力自动化设备》2017年04期 　论文类型：期刊论文

【摘要】：传统的静态安全分析需要对预想故障集中的预想故障进行多次网络重构和潮流计算,计算量和计算时间随电网规模的增大而快速增加,使得静态安全分析在实时分析和预警中不能满足全网分析的需求。提出一种基于网络分块算法的新型迭代方法,将全网合理划分为较为均匀的子网络,降低网络矩阵的维数,通过边界协调变量联系各子网络,有效提高计算速度。基于静态安全分析中故障潮流的特点提出适用于该算法的弱收敛性条件,该收敛条件使得每步迭代的计算量随迭代次数增加快速减少。仿真分析证明所提收敛条件容易达到,使得所提算法具有良好的收敛性。
[Abstract]:The traditional static security analysis requires multiple network reconfiguration and power flow calculation for the preconceived fault set. The computational complexity and computing time increase rapidly with the increase of the power network size. The static security analysis can not meet the needs of the whole network analysis in real-time analysis and early warning. A new iterative method based on the network block algorithm is proposed to reasonably divide the whole network into more uniform subnetworks. The dimension of the network matrix is reduced and the subnetworks are connected with the boundary coordination variables to improve the computing speed effectively. Based on the characteristics of the fault power flow in static security analysis, the weak convergence conditions for the algorithm are proposed. The convergence condition makes the computational complexity of each iteration decrease rapidly with the number of iterations. The simulation results show that the proposed convergence conditions are easy to achieve and the proposed algorithm has good convergence.
【作者单位】：华北电力大学电气与电子工程学院;国网甘肃省电力公司电力科学研究院;
【基金】：国家科技支撑计划(2015BAA01B04) 国家电网公司科技项目(52272214002C)~~
【分类号】：TM744
【正文快照】： 0引言传统的静态安全分析方法需要形成预想事故集合并对其中的每种事故进行网络重构和潮流计算,得出故障后电网的各个运行变量,从而判断电网的静态安全性。且潮流计算的计算量与电力系统中的独立节点数密切相关,在应用牛顿-拉夫逊法计算时,其雅可比矩阵的阶数为2N-2,在迭代过

【相似文献】