潮流方程鞍结分岔点计算的块消去算法
Block Elimination Algorithms for the Saddle-node Bifurcation Point of Power Flow Equations
-
摘要: 潮流方程鞍结分岔点(saddle-node bifurcation point,SNBP)的计算是静态电压稳定分析中比较关键的问题。在电力系统中,Moore-Spence方程被常用来确定潮流方程的鞍结分岔点,其阶数约为一般潮流方程的2倍。采用在非线性分歧计算中常使用的块消去(block elimination,BE)算法来求解Moore-Spence方程。利用块消去算法,在Moore-Spence方程的每一步牛顿迭代过程中,只需求解潮流雅可比矩阵或其转置作为系数矩阵的线性方程组,可充分利用潮流雅可比矩阵的稀疏特点来提高计算效率。采用渐进数值方法(asymptotic numerical method,ANM)快速确定牛顿迭代的初值。国内几个电力系统的计算实例验证了该方法的有效性。Abstract: Techniques for calculating the saddle-node bifurcation point(SNBP) of power flow equations are fundamental to steady-state voltage stability analysis.In power system,the Moore-Spence equation has been used to calculate the SNBP of power flow equations,the dimension of which is about the twice that of the general power flow equations.This paper presented an efficient method to solve the Moore-Spence equation with the block elimination(BE) algorithms,which are frequently used in nonlinear bifurcation computing.With BE,a set of linear equations with power flow Jacobian or its transpose as coefficient matrix are to be solved in the solution procedure,and sparsity of power flow Jacobian can be exploited to enhance computational efficiency.Also,asymptotic numerical method(ANM) was used to determine the initial values for Newton iterations.Numerical examples in several power systems were presented to validate the method.