PQ分解法潮流收敛性及收敛速度的新探讨

发布时间：2018-12-08 17:38

【摘要】：全面分析比较了PQ分解法潮流计算中不同B′、B″阵参数组合及计算过程对收敛性的影响,分别提出影响收敛性和迭代次数的主要参数。同时考虑打开或建立B′、B″阵数据文件的个数、形成因子表或三角分解的次数、完成前代和回代过程的方式等对PQ分解法收敛速度的影响。通过上述分析可知,在B′阵中去掉参数c,在B″阵中去掉参数r基本可保证对各个系统均有较好的收敛性;去掉B′阵中参数k可减少迭代次数;B′、B″阵的其余参数对收敛性及收敛速度的影响非常小,几乎可忽略不计。因此可知,B′、B″阵在仅保留参数电抗的最简形式下,不但可确保系统的收敛,而且可使潮流计算的速度最快。以IEEE-118节点系统为例,B′、B″阵在最简形式下的计算时间比迭代次数最少的计算时间快约22%。
[Abstract]:In this paper, the effects of different parameters combination and calculation process on convergence in power flow calculation by PQ decomposition method are analyzed and compared. The main parameters affecting convergence and iteration times are presented respectively. At the same time, the influence of the number of data files opened or set up, the number of factor tables or triangular decomposition, the way of completing the previous generation and the reproducing process on the convergence rate of the PQ decomposition method are considered. Through the above analysis, we can know that removing parameter c in B 'matrix and removing parameter r in B "matrix can basically ensure better convergence for all systems, and removing parameter k in B' matrix can reduce the number of iterations. The effect of the other parameters on the convergence and the convergence rate is very small and almost negligible. Therefore, it can be seen that the simple form of the B "matrix can not only ensure the convergence of the system, but also make the calculation of power flow the fastest in the case of retaining only the simplest form of parametric reactance. Taking the IEEE-118 node system as an example, the computing time of the IEEE-118 B "matrix in the simplest form is about 22 times faster than that of the least iteration number."
【作者单位】：南昌大学信息工程学院;国网江西省电力公司检修分公司;
【基金】：江西省研究生创新专项资金项目(YC2016-S065) 南昌大学研究生创新专项资金项目(CX 2016268)
【分类号】：TM744

【相似文献】