A Lucid and fast Algorithm for N-k Contingencies Based on Low-Rank Update
- https://doi.org/10.2991/icimm-16.2016.49How to use a DOI?
- Low-rank update; N-k; Contingency
In this paper, the low rank update mathematics was employed to N-k contingencies computation. In the method, the two low-rank matrixes correspond respectively location and modification values were constructed. The amount of calculation was decreased greatly due to the node admittance matrix was revised by the product of two low-rank matrixes and the inversion of the modified matrix is obtained by computation of low-rank matrixes base on original admittance matrix. The test result indicates that the method is lucid and fast due to avoid re-factorization, and can be used flexibility in multi-outages as can be calculated at once. Accordingly, it is suitable for N-k contingencies computation of large-scale power system, which the whole calculation process is on sparse admittance matrix and calculations of low-rank matrix. Finally, an S-1047 system was employed analyze the validity and practicality of this proposed method.
- © 2016, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Aihua Jiang AU - Hua Wei PY - 2016/11 DA - 2016/11 TI - A Lucid and fast Algorithm for N-k Contingencies Based on Low-Rank Update BT - Proceedings of the 6th International Conference on Information Engineering for Mechanics and Materials PB - Atlantis Press SP - 256 EP - 261 SN - 2352-5401 UR - https://doi.org/10.2991/icimm-16.2016.49 DO - https://doi.org/10.2991/icimm-16.2016.49 ID - Jiang2016/11 ER -