{'fraction_non_alphanumeric': 0.02170767004341534, 'fraction_numerical': 0.011577424023154847, 'mean_word_length': 5.0701754385964914, '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 scalable dual-primal domain decomposition method

We blend dual and primal domain decomposition approaches to construct a fast iterative method for the solution of large-scale systems of equations arising from the finite element discretization of second- and fourth-order partial differential equations. We show numerically that our method is scalable with respect to the mesh size, the subdomain size, and the number of elements per subdomain. We apply it to the solution of several realistic structural mechanics problems, and report on parallel performance results obtained on an Origin 2000 system, as well as the ASCI Option Red supercomputer. Copyright © 2000 John Wiley & Sons, Ltd.