From: lilia Date: Sat, 9 May 2015 11:26:45 +0000 (+0200) Subject: petites modifs section 4 X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/rce2015.git/commitdiff_plain/ae6852ff5a03d7e448675ad4899d1cf8d3195b2f?ds=sidebyside;hp=-c petites modifs section 4 --- ae6852ff5a03d7e448675ad4899d1cf8d3195b2f diff --git a/paper.tex b/paper.tex index 6f1cc96..45c50f4 100644 --- a/paper.tex +++ b/paper.tex @@ -401,7 +401,7 @@ where right-hand sides $c_\ell=b_\ell-\sum_{m\neq\ell}A_{\ell m}x_m$ are compute %\end{algorithm} \end{figure} -In this paper, we propose two algorithms of two-stage multisplitting methods. The first algorithm is based on the asynchronous model which allows communications to be overlapped by computations and reduces the idle times resulting from the synchronizations. So in the asynchronous mode, our two-stage algorithm uses asynchronous outer iterations and asynchronous communications between clusters. The communications (i.e. lines~\ref{send} and~\ref{recv} in Figure~\ref{alg:01}) are performed by message passing using MPI non-blocking communication routines. The convergence of the asynchronous iterations is detected when all clusters have locally converged: +In this paper, we propose two algorithms of two-stage multisplitting methods. The first algorithm is based on the asynchronous scheme which allows communications to be overlapped by computations and reduces the idle times resulting from the synchronizations. So in the asynchronous mode, our two-stage algorithm uses asynchronous outer iterations and asynchronous communications between clusters. The communications (i.e. lines~\ref{send} and~\ref{recv} in Figure~\ref{alg:01}) are performed by message passing using MPI non-blocking communication routines. The convergence of the asynchronous iterations is detected when all clusters have locally converged: \begin{equation} k\geq\MIM\mbox{~or~}\|x_\ell^{k+1}-x_\ell^k\|_{\infty }\leq\TOLM, \label{eq:04}