{'fraction_non_alphanumeric': 0.014395393474088292, 'fraction_numerical': 0.0, 'mean_word_length': 5.028901734104046, '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}}
AN EFFICIENT TRANSMISSION OPERATOR FOR COMPUTING WAVE PROPAGATION BY DOMAIN DECOMPOSITION

. For large size problems, domain decompositions can be used to solve wave propagation problems such as the Helmholtz equation. Generally, this leads to an iterative process where data are exchanged at the boundary between subdomains. Depending on the quality of this exchange the number of iterations is more or less. Moreover, this number of iterations can depend on the frequency and on the number of domains. Here, we propose transmission operators approximating the Dirichlet to Neumann (DtN) operator which is known to be near optimal. We show this can be done using only the solution of problems involving sparse matrices and so keeping the computational time at an acceptable level. When this is combined with the double sweep preconditioner and that the computational domain is decomposed into a sequel of slices this results in an algorithm with a low number of iterations. Different examples are presented to support the precedent analysis.