Contents 1.0 Introduction
All the parallel approaches are based on the non-overlapping subdomain [1], [2]. There is no data swap between the neighboring processors at the iteration but there are inter-processor communications between the iteration and the next iteration . A typical parallel implementation of a parallel AGE assigns several mesh points to each processor such that each processor only communicates with its two nearest neighbors [3]. The computations of the approximation solutions in sub domain are executed independently. The stopping criteria in the processors are investigated by measuring the size of the inner residuals. Let us define the residual computed in the processors . This quantity is kept in the processor's memory between successive iterations and it is checked if the residual is reduced by the convergence criterion. The master processor checked the maximum of local convergence criterion and the iteration stopped when the global convergence criterion is met.
