Vectorizable implicit algorithms for the flux-difference split, three-dimensional Navier-Stokes equations

Abstract

The computational efficiency of four vectorizable implicit algorithms is assessed when applied to calculate steady-state solutions to the three-dimensional, incompressible Navier-Stokes equations in general coordinates. Two of these algorithms are characterized as hybrid schemes; that is, they combine some approximate factorization in two coordinate directions with relaxation in the remaining spatial direction. The other two algorithms utilize an approximate factorization approach which yields two-factor algorithms for three-dimensional systems. All four algorithms are implemented in identical high-resolution upwind schemes for the flux-difference split Navier-Stokes equations. These highly nonlinear schemes are obtained by extending an implicit Total Variation Diminishing (TVD) scheme recently developed for linear one-dimensional systems of hyperbolic conservation laws to the three-dimensional Navier-Stokes equations. The computation of vortical flow over a sharp-edged, thin delta wing has been chosen as a common numerical test case. The convergence of the algorithms is discussed and the accuracy of the computed flow-field results is assessed. The validity of the present results are demonstrated by a comparison with experimental data.