{'fraction_non_alphanumeric': 0.019095477386934675, 'fraction_numerical': 0.0, 'mean_word_length': 5.425806451612903, '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 Mixed Potential MLFMA for Higher Order Moment Methods With Application to the Generalized Method of Moments

The application of the multilevel fast multipole algorithm (MLFMA) to higher order moment method discretizations is a continuing open problem. Herein, we present a point-based mixed potential variant of the MLFMA algorithm that exhibits an MLFMA tree of arbitrary height with no restriction related to basis function support size, efficient nearfield precomputation, and that maintains favorable scaling for any mixture of low- and high-order bases. The flexibility of the algorithm is also leveraged to accelerate the precomputation of algebraic preconditioners. We demonstrate the method through application to the generalized method of moments (GMM), a recently introduced moment method discretization capable of combining both low- and high-order bases and geometries in the same simulation; however, the method may be used to accelerate other higher order moment methods as well.