{'fraction_non_alphanumeric': 0.033816425120772944, 'fraction_numerical': 0.008051529790660225, 'mean_word_length': 4.923809523809524, '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}}
The modified matrix splitting iteration method for computing PageRank problem

In this paper, based on the iteration methods [3,10], we propose a modified
 multi-step power-inner-outer (MMPIO) iteration method for solving the
 PageRank problem. In the MMPIO iteration method, we use the multi-step
 matrix splitting iterations instead of the power method, and combine with
 the inner-outer iteration [24]. The convergence of the MMPIO iteration method
 is analyzed in detail, and some comparison results are also given. Several
 numerical examples are presented to illustrate the effectiveness of the
 proposed algorithm.