{'fraction_non_alphanumeric': 0.018867924528301886, 'fraction_numerical': 0.0, 'mean_word_length': 5.417582417582418, '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}}
A new approach to analyticity of Dirichlet-Neumann operators

This paper outlines the theoretical background of a new approach towards an accurate and well-conditioned perturbative calculation of Dirichlet-Neumann operators (DNOs) on domains that are perturbations of simple geometries. Previous work on the analyticity of DNOs has produced formulae that, as we have found, are very ill-conditioned. We show how a simple change of variables can lead to recursions that satisfy analyticity estimates without relying on subtle cancellation properties at the heart of previous formulae.