From 538afc25a7a90630d2f90891d0a4d700bfe3460f Mon Sep 17 00:00:00 2001
From: ziane <ziane@spirou.ltas.ulg.ac.be>
Date: Fri, 8 May 2015 12:29:35 +0200
Subject: [PATCH 1/1] =?utf8?q?Coorections=20exp=C3=A9=205.4.1=C2=B2?=
MIME-Version: 1.0
Content-Type: text/plain; charset=utf8
Content-Transfer-Encoding: 8bit

---
 paper.tex | 33 +++++++++++++++------------------
 1 file changed, 15 insertions(+), 18 deletions(-)

diff --git a/paper.tex b/paper.tex
index e37e28c..a2e23a2 100644
--- a/paper.tex
+++ b/paper.tex
@@ -549,14 +549,25 @@ Grid architecture                       & 2$\times$16, 4$\times$8, 4$\times$16 a
 \end{center}
 \end{table}
 
-
-
-
 \subsubsection{Simulations for various grid architectures and scaling-up matrix sizes}
 \  \\
 % environment
+In this section, we analyze the simulations conducted on various grid configurations and for different sizes of the 3D Poisson problem. The parameters of the network between clusters is fixed to $N1$ (see Table~\ref{tab:01}. Figure~\ref{fig:01} shows, for all grid configurations and a given matrix size 170$^3$ elements, a non-variation in the number of iterations for the classical GMRES algorithm, which is not the case of the Krylov two-stage algorithm.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
 
-Table~\ref{tab:01} summarizes the different parameters used in the simulations: the grid architectures, the network of inter-cluster backbone links and the matrix sizes of the 3D Poisson problem.
 
 
 
@@ -568,20 +579,6 @@ Table~\ref{tab:01} summarizes the different parameters used in the simulations:
 
 
 
-In  this  section,  we  analyze   the  simulations  conducted  on  various  grid
-configurations presented  in Table~\ref{tab:01}. It  should be noticed  that two
-networks are considered: N1 is  the network between clusters (inter-cluster) and
-N2 is the network inside  a cluster (intra-cluster).  Figure~\ref{fig:01} shows,
-for all  grid configurations  and a  given matrix size,  a non-variation  in the
-number of iterations for the classical GMRES algorithm, which is not the case of
-the Krylov two-stage algorithm.
-%% First,  the results in  Figure~\ref{fig:01}
-%% show for all grid configurations the non-variation of the number of iterations of
-%% classical  GMRES for  a given  input matrix  size; it is not  the case  for the
-%% multisplitting method.
-%\RC{CE attention tu n'as pas mis de label dans tes figures, donc c'est le bordel, j'en mets mais vérifie...}
-%\RC{Les légendes ne sont pas explicites...}
-%\RCE{Corrige}
 
 \begin{figure} [htbp]
   \begin{center}
-- 
2.39.5