{'fraction_non_alphanumeric': 0.012779552715654952, 'fraction_numerical': 0.004259850905218318, 'mean_word_length': 5.573426573426573, '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}}
Balancing domain decomposition

The Neumann–Neumann algorithm is known to be an efficient domain decomposition preconditioner with unstructured subdomains for iterative solution of finite-element discretizations of difficult problems with strongly discontinuous coefficients (De Roeck and Le Tallec, 1991). However, this algorithm suffers from the need to solve in each iteration an inconsistent singular problem for every subdomain, and its convergence deteriorates with increasing number of subdomains due to the lack of a coarse problem to propagate the error globally. We show that the equilibrium conditions for the singular problems on subdomains lead to a simple and natural construction of a coarse problem. The construction is purely algebraic and applies also to systems such as those that arise in elasticity. A convergence bound independent of the number of subdomains is proved and results of computational tests are reported.