{'fraction_non_alphanumeric': 0.022565320665083134, 'fraction_numerical': 0.0, 'mean_word_length': 4.62, '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}}
One Step Closer to an Optimal Two-Parameter SOR Method: A Geometric Approach

The well-known SOR method is obtained from a one-part splitting of the system matrix A, using one parameter ω for the diagonal. A strong interest in using more than one parameter for the SOR method to improve the convergence has been developed. Sisler, Niethammer, and Hadiidimos worked on the two-parameter method in the seventies. This author has generalized Sisler’s method and introduced a range for the second parameter, providing a faster two-parameter method compared to the SOR method. In this paper, we go one step further by removing the hypothesis that requires the eigenvalues of the Jacobi iteration matrix to be real. The result is an optimal value for the second parameter when the eigenvalues of the SOR method are in a certain well-defined region.