{'fraction_non_alphanumeric': 0.014150943396226415, 'fraction_numerical': 0.0, 'mean_word_length': 5.37, '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}}
Fast solution of linear systems with many right hand sides using MPI parallel interpolative decomposition

The interpolative decomposition (ID) has been employed to find the skeleton excitations for the applications where many incidents have to be repeatedly solved. The algorithm is accuracy controllable and efficient. However, the peak memory usage may be the bottleneck of the decomposition when the number of unknowns and that of incidents become large. In this work, the parallel ID is developed to alleviate the difficulty. Numerical experiments have been conducted to demonstrate the performance of the proposed parallel scheme.