{'fraction_non_alphanumeric': 0.007029876977152899, 'fraction_numerical': 0.0, 'mean_word_length': 5.263736263736264, '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}}
Solution of symmetric matrix equations using star to complete polygon circuit transformations

In this paper, a complete polygon electric circuit is used to model general symmetric linear algebraic systems of equations and an optimum technique is employed to solve the circuit problem based on successive star to complete polygon transformations. The values of the unknowns of a given system of equations are identical with the nodal potential values of its model circuit. The number of arithmetic operations required is about half of that for the Gaussian elimination.