{'fraction_non_alphanumeric': 0.017857142857142856, 'fraction_numerical': 0.0, 'mean_word_length': 5.7847533632287, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Reduce–factor–solve for fast Thevenin impedance computation and network reduction

The complexity and volatility of power system operation increase when larger parts of the power production is based on distributed and non-controllable renewable energy sources. Ensuring stable and secure operation becomes more difficult in these modern power systems. For security assessment, the results of traditional offline simulations may become obsolete prior to the completion of the assessment. In contrast, real-time stability and security assessment aims at online computation, and it is therefore dependent on very fast computation of properties of the grid operating state. The study develops the reduce–factor–solve approach to real-time computation of two key components in real-time assessment methods, network reduction, and calculation of Thevenin impedances. The aim is to allow online stability assessment for very complex networks. The theoretical foundation behind the reduce–factor–solve approach is described together with the ability to handle both algorithms in a common framework. By exploiting parallelisation of the reduce and solve steps in combination with fast matrix factorisation, Thevenin impedances and reduced networks are computed much faster than previous approaches. The reduce–factor–solve algorithm is evaluated on power grids of varying complexity to show that Thevenin impedance computation and network reduction for complex power systems can be performed on a milliseconds time scale.