{'fraction_non_alphanumeric': 0.007905138339920948, 'fraction_numerical': 0.0, 'mean_word_length': 5.5, '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}}
Threshold-pivoting in parallel Gaussian elimination for improved efficiency

The use of threshold pivoting with the purpose to reduce fill-in during sparse Gaussian elimination has been generally acknowledged. Here we describe the application of threshold pivoting in dense Gaussian elimination for improving the performance of a parallel implementation. We discuss the effect on the numerical stability and conclude that the consequences are only of minor importance as long as the threshold is not chosen