{'fraction_non_alphanumeric': 0.030303030303030304, 'fraction_numerical': 0.005050505050505051, 'mean_word_length': 5.839080459770115, '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}}
Convergence Estimates of Multilevel Additive and Multiplicative Algorithms for Non-symmetric and Indefinite Problems

New uniform estimates for multigrid algorithms are established for certain non-symmetric indefinite problems. In particular, we are concerned with the simple additive algorithm and multigrid (V(1 , 0)-cycle) algorithms given in [5]. We prove, without full elliptic regularity assumption, that these algorithms have uniform reduction per iteration, independent of the finest mesh size and number of refinement levels, provided that the coarsest mesh size is sufficiently small.