{'fraction_non_alphanumeric': 0.015407190022010272, 'fraction_numerical': 0.0, 'mean_word_length': 5.373831775700935, '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}}
A more efficient arrangement of the sparse LU factorization for the large-scale circuit analysis

In the paper, an efficient and reliable algorithm for solving the circuit nonlinear algebraic-differential equations based on a sophisticated arrangement of Newton interpolation polynomial is characterized first. After that, a novel method is introduced for improving the convergence with four suggested criteria that are being compared. Unlike the similar algorithms focused on an operating point analysis only, the proposed method also works in a transient analysis. For enhancing the efficiency of repeated solutions of linear systems necessary in the Newton-Raphson method, a novel modification of the Markowitz criterion is suggested, which is compatible with the fast modes of the LU factorization. The modified criterion consists in an estimation of probabilities of the fill-in enlargement. The probabilities are determined for all columns of the system matrix before the LU factorization, where the column probability is calculated as the average value of the probabilities for all the column elements. Finally, the columns are reordered so that first and last should be those with the minimum and maximum probabilities, respectively. As a verification of this fundamental proposal of the paper, a comprehensive set of numerical tests has been carried out.