{'fraction_non_alphanumeric': 0.019296254256526674, 'fraction_numerical': 0.004540295119182747, 'mean_word_length': 6.112903225806452, '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}}
Hierarchical hybrid grids: data structures and core algorithms for multigrid

For many scientific and engineering applications, it is often desirable to use unstructured grids to represent complex geometries. Unfortunately, the data structures required to represent discretizations on such grids typically result in extremely inefficient performance on current high‐performance architectures. Here, we introduce a grid framework using patch‐wise, regular refinement that retains the flexibility of unstructured grids, while achieving performance comparable to that seen with purely structured grids. This approach leads to a grid hierarchy suitable for use with geometric multigrid methods, thus combining asymptotically optimal algorithms with extremely efficient data structures to obtain a powerful technique for large scale simulations. Copyright © 2004 John Wiley & Sons, Ltd.