This paper presents some new results concerning the direct solution of large systems of equations resulting from the fully implicit, coupled solution of the Euler and Navier-Stokes equations in three dimensions. Two methods for such direct solution have been investigated: the first is based on the application of sparse matrix algorithms and the second on the implementation of a Gauss elimination algorithm optimized for vector-parallel processing on Cray supercomputers. Results indicate that sparse matrix algorithms consistently deteriorate for rectangular, i.e. N × N × M grids in three dimensions, as M gets larger than N. On the other hand, Gauss elimination seems to be ideally suited for processing on today's supercomputers, achieving execution rates up to 83% of the Cray-YMP peak efficiency.
Read full abstract