11-12-2014 v05

diff --git a/krylov_multi_reviewed.tex b/krylov_multi_reviewed.tex
index 978a03a86e2ca3981f1c3fbbb27de7c5d23aa765..a5c7827164382f23aa4c32b953e0db3249ff9a3b 100644 (file)
--- a/krylov_multi_reviewed.tex
+++ b/krylov_multi_reviewed.tex
@@ -93,12 +93,13 @@ using  asynchronous  iterative  methods~\cite{ref18}  or in  using  multisplitti
 algorithmss.  In this  paper,  we will  reconsider  the use  of a  multisplitting
 method. In opposition to traditional multisplitting method that suffer from slow
 convergence, as  proposed in~\cite{huang1993krylov},  the use of  a minimization
 algorithmss.  In this  paper,  we will  reconsider  the use  of a  multisplitting
 method. In opposition to traditional multisplitting method that suffer from slow
 convergence, as  proposed in~\cite{huang1993krylov},  the use of  a minimization

-process can drastically improve the convergence.
+process can drastically improve the convergence.\\

 
 
 %%% AJOUTE************************
 %%%*******************************
 
 
 %%% AJOUTE************************
 %%%*******************************

-In this work we develop a new parallel two-stage algorithm for large-scale clusters. Our objective is to mix between Krylov based iterative methods and the multisplitting method to improve the scalability. In fact Krylov subspace methods are well-known for their good convergence compared to others iterative methods. So our main contribution is to use the multisplitting method which splits the problem to solve into different blocks in order to reduce the large amount of communications and, to implement both inner and outer iterations as Krylov subspace iterations improving the convergence of the multisplitting algorithm.
+\noindent {\bf Contributions:}\\ 
+In this work we develop a new parallel two-stage algorithm for large-scale clusters. Our objective is to mix between Krylov based iterative methods and the multisplitting method to improve the scalability. In fact Krylov subspace methods are well-known for their good convergence compared to others iterative methods. So our main contribution is to use the multisplitting method which splits the problem to solve into different blocks in order to reduce the large amount of communications and, to implement both inner and outer iterations as Krylov subspace iterations improving the convergence of the multisplitting algorithm.\\

 %%%*******************************
 %%%*******************************
 
 %%%*******************************
 %%%*******************************
 


@@ -359,10 +360,10 @@ We have performed some experiments on an infiniband cluster of 3 nodes of Intel
 \begin{figure}[htbp]
 \centering
 \begin{tabular}{c}
 \begin{figure}[htbp]
 \centering
 \begin{tabular}{c}

-\includegraphics[width=0.8\textwidth]{weak_scaling_280k} \\ (a) \includegraphics[width=0.8\textwidth]{weak_scaling_280K}\\
+\includegraphics[width=0.8\textwidth]{weak_scaling_280k} \\ \includegraphics[width=0.8\textwidth]{weak_scaling_280K}\\

 \end{tabular}
 \caption{Weak scaling with 3 blocks of cores}
 \end{tabular}
 \caption{Weak scaling with 3 blocks of cores}

-\label{fig:001}
+\label{fig:002}

 \end{figure}
 
 %%%********************************
 \end{figure}
 
 %%%********************************

diff --git a/strong_scaling_150x150x150.pdf b/strong_scaling_150x150x150.pdf
index 8925ec54d528619e8f231ac822e94759138c1b22..b1617b62dd9cb6bc6e12c8434ba1d817aed4c48a 100644 (file)
Binary files a/strong_scaling_150x150x150.pdf and b/strong_scaling_150x150x150.pdf differ

diff --git a/weak_scaling_280K.pdf b/weak_scaling_280K.pdf
index a397491b79241427df8a3f50cdcd6a868339ac06..cc94ccd0eb2e144589014d93a5566841f93585dc 100644 (file)
Binary files a/weak_scaling_280K.pdf and b/weak_scaling_280K.pdf differ

diff --git a/weak_scaling_280k.pdf b/weak_scaling_280k.pdf
index a918356eb02f9a9aea9040e4961d7d3e1b09792e..376f44db3e3f15fb986250d48762b99905ef5170 100644 (file)
Binary files a/weak_scaling_280k.pdf and b/weak_scaling_280k.pdf differ