{'fraction_non_alphanumeric': 0.02112676056338028, 'fraction_numerical': 0.0035211267605633804, 'mean_word_length': 5.716535433070866, '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}}
High-performance computing simulations of self-gravity in astronomical agglomerates

This article describes the advances in the design, implementation, and evaluation of efficient algorithms for self-gravity simulations in astronomical agglomerates. Three algorithms are presented and evaluated: the occupied cells method, and two variations of the Barnes–Hut method using an octal and a binary tree. Two scenarios are considered in the evaluation: two agglomerates orbiting each other and a collapsing cube. The results show that the proposed octal tree Barnes–Hut method allows improving the performance of the self-gravity calculation up to 100 times with respect to the occupied cells method, while having good numerical accuracy. The proposed algorithms are efficient and accurate methods for self-gravity simulations in astronomical agglomerates.