{'fraction_non_alphanumeric': 0.012345679012345678, 'fraction_numerical': 0.0, 'mean_word_length': 4.970588235294118, '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}}
CGNR Is an Error Reducing Algorithm

The CGNR algorithm is a robust algorithm solving large nonsymmetric linear systems. In this short note, we show that the norm of the error vector of CGNR approximation decreases monotonically during its iteration. Few iterative algorithms have this error reducing property. The result indicates that the simple CGNR algorithm is still a potential one in practical use.