Fast Static Security Analysis Based on Rapid Factor Table Transformation

With the development of novel power systems, the scenarios required for static security analysis(SSA) have become increasingly complex and varied. Therefore, this paper proposes a fast SSA method for electrical node addition scenarios based on rapid factor table transformation(RFTT). This method first proposes a two-step strategy to simplify the factor table transformation process in the scenario of adding electrical nodes, and divides the complex problem into two parts: the problem of keeping the number of nodes constant and the problem of increasing the number of nodes. Aiming at the problem of constant number of nodes, an improved rank 1 method is proposed to solve it. This method can quickly convert the incremental matrix into an input form that can be processed by the rank 1 method, overcoming the drawbacks of traditional rank 1 methods that require eigenvalue decomposition. Regarding the problem of increasing the number of nodes. The edge-addition method was proposed to solve the problem, which can handle complex new node connection relationships and break through the limitations of previous methods in application scenarios. Finally, the proposed method was tested on multiple systems such as matpower case300, 1354, 1888, 2383, and 3012, and showed significant advantages over traditional full LDU decomposition in both conventional and extreme scenarios, significantly improving the speed of static security analysis.