Parallel implicit unstructured grid Euler solvers
A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on a multiple-instruction/multiple-data stream parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed: one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All of the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the Intel iPSC/860. 23 refs.
- Research Organization:
- National Aeronautics and Space Administration, Hampton, VA (United States). Langley Research Center
- OSTI ID:
- 45879
- Journal Information:
- AIAA Journal, Journal Name: AIAA Journal Journal Issue: 10 Vol. 32; ISSN AIAJAH; ISSN 0001-1452
- Country of Publication:
- United States
- Language:
- English
Similar Records
Stage-parallel fully implicit Runge–Kutta solvers for discontinuous Galerkin fluid simulations
Improved convergence to the steady state of the Euler equations by enhanced wave propagation