Abstract
An upwind relaxation-sweeping algorithm for the complete 3D compressible Navier-Stokes equations has been developed. The algorithm implements the relaxation iteration on the vertical streamwise plane, and then sweeps alternately in spanwise direction. The algorithm can reach very high CFL number due to the unfactored relaxation scheme without the approximation error introduced. The memory requirement is greatly reduced because the matrices are only stored in one iterating plane. The computational experiments show that the high convergence rate of the algorithm is independent of grid size. The computational results agree with the experiments. (Author)