{'fraction_non_alphanumeric': 0.02022058823529412, 'fraction_numerical': 0.0009191176470588235, 'mean_word_length': 5.443786982248521, '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 parallel Newton-Krylov flow solver for the Euler equations on multi-block grids

We present a parallel Newton-Krylov algorithm for solving the three-dimensional Euler equations on multi-block structured meshes. The Euler equations are discretized on each block independently using second-order accurate summation-by-parts operators and scalar numerical dissipation. Boundary conditions are imposed and block interfaces are coupled using simultaneous approximation terms (SATs). The resulting discrete equations are solved iteratively using an inexact Newton method. At each Newton iteration, the linear system is solved inexactly using a Krylov subspace iterative method, and both additive Schwarz and approximate Schur preconditioners are considered. The algorithm is tested on the ONERA M6 wing. The results show that a discretization based on SATs is well suited to a parallel Newton-Krylov solution strategy, and that the approximate Schur preconditioner is more efficient than the Schwarz preconditioner in terms of CPU time and Krylov iterations, for both flow and adjoint solves.