Parallel computation of compressible flows for implicit schemes without sub-iteration and modification of the implicit solver

Parallel computation for fluid flow problems has become very useful in the end of the last, century and will certainly be very popular in the 21st century for handling large scale problems. Implicit schemes are efficient for obtaining steady state solutions and for treating slowly unsteady flows. However, implicit schemes are not inherently parallel and their parallelization usually requires addtional iteration or modification of the implicit solvers. Thus the parallelization of implicit, schemes is accessible only to experts specialized in parallization. In [9, 12], a parallel method based on grid overlapping was proposed for inviscid flow computation. This method requires no additional iterations at each time step, and lior modification of the implicit solver. In this paper we analyze and use this method for viscous flow computation. We conclude that optimal parallel efficiency corresponds to an overlapping width determined by CFL, and the results are similar to inviscid problems for a sufficiently large mesh Reynolds number.