Large‐scale computational fluid dynamics by the finite element method

Solution methods are presented for the large systems of linear equations resulting from the implicit, coupled solution of the Navier-Stokes equations in three dimensions. Two classes of methods for such solution have been studied: direct and iterative methods. For direct methods, sparse matrix algorithms have been investigated and a Gauss elimination, optimized for vector-parallel processing, has been developed. Sparse matrix results indicate that reordering algorithms deteriorate for rectangular, i.e. M × M × N, grids in three dimensions as N gets larger than M. A new local nested dissection reordering scheme that does not suffer from these difficulties, at least in two dimensions, is presented. The vector-parallel Gauss elimination is very efficient for processing on today's supercomputers, achieving execution rates exceeding 2.3 Gflops the Cray YMP-8 and 9.2 Gflops on the NEC on SX3. For iterative methods, two approaches are developed. First, conjugate-gradient-like methods are studied and good results are achieved with a preconditioned conjugate gradient squared algorithm. Convergence of such a method being sensitive to the preconditioning, a hybrid viscosity method is adopted whereby the preconditioner has an artificial viscosity that is gradually lowered, but frozen at a level higher than the dissipation introduced in the physical equations. The second approach is a domain decomposition one in which overlapping domain and side-by-side methods are tested. For the latter, a Lagrange multiplier technique achieves reasonable rates of convergence.