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.
Parallel implicit unstructured grid Euler solvers
AIAA Journal ; 32 , 10
1994-10-01
Miscellaneous
No indication
English
Parallel implicit unstructured grid Euler solvers
AIAA | 1994
|Parallel Implicit Unstructured Grid Euler Solvers
British Library Conference Proceedings | 1994
|Parallel Implicit Unstructured Grid Euler Solvers
Online Contents | 1994
|Parallel Implicit Unstructured Grid Euler Solvers
British Library Conference Proceedings | 1994
|Parallel implicit unstructured grid Euler solvers
AIAA | 1994
|