Abstract

This paper deals with the parallel implementation on distributed memory architectures of the implicit residual smoothing procedure in the context of a explicit method for two dimensional inviscid flows. The governing equations are discretized by a cell centered finite volume method and the time integration is performed by a explicit Runge Kutta method. Artificial dissipation and implicit residual smoothing are used in order to stabilize and speed up the method. The parallelism is introduced by grid partitioning. The parallel implementation of the residual smoothing, a inherently implicit procedure, is crucial for the efficiency of the method. Here, two different parallel residual smoothing strategies are discussed and some experimental results are given to illustrate parallel performances of the proposed strategies.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call