| 摘要: |
| 提出了一种将低阶更新法应用于短路电流N-k计算的新方法。该方法通过构造两个低阶矩阵，利用其乘积对节点导纳矩阵进行修正，再根据已分解的原始导纳矩阵因子表，通过低阶矩阵运算，避免修正后的导纳矩阵重新因子化，从而减少了计算量，且不受断开支路数量的限制，实现多条支路开断一次修正计算完成，易于适应运行方式多变的要求。与现有方法相比，低阶更新法既解决了传统修改导纳矩阵重新形成因子表而引起的计算量大的问题，又克服了补偿法在诸如开断三绕组变压器、自耦变压器，母线上多设备同时检修等多个元件同时变化时就不再实用的缺陷。通过对S-1047系统进行计算，验证了该方法的有效性和实用性。 |
| 关键词: 低阶更新 补偿法 N-k 短路计算 |
| DOI：10.7667/j.issn.1674-3415.2013.22.002 |
|
| 基金项目:国家自然科学基金项目（51167001）；广西自然科学基金项目（2011GXNSFA018018） |
|
| A fast algorithm of N-k short-circuit current based on low-rank update method |
| JIANG Ai-hua,WEI Hua |
| () |
| Abstract: |
| This paper proposes a novel idea that a low-rank update algorithm is used to calculate N-k short-circuit current. In the method, the node admittance matrix is revised by the product of two low-rank matrixes that had been constructed. Afterwards according to the originally decomposed admittance matrix factor table and the result of calculation of low-rank matrixes, the revised admittance matrix is avoided to be refactorized, so the amount of calculation is decreased greatly. Since it is not restricted by the quantity of broken branches, the correction computation of broken multi-branches can be finished all at once, which adapts to the requirement of variable operation modes. Comparing with the present methods, the low-rank update method avoids the problem caused by the big calculative amount from reforming factor table due to the modified original admittance matrix, and by the complicated process of calculation in the compensation method due to the recursion when multi-lines are broken synchronously such as breaking three-winding transformer, autotransformer, and multicomponent on bus. Finally, an S-1047 system is employed to analyze the validity and practicality of this proposed method. |
| Key words: low-rank update compensation method N-k short-circuit current |
