English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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.

A Lucid and fast Algorithm for N-k Contingencies Based on Low-Rank Update