V-17-12-2013

diff --git a/krylov_multi.tex b/krylov_multi.tex
index 8a64840d9ddb1bad5ccfe26e06b39383b362c9de..b96a5b9aec0e9a27f59c84477910225b2fb1ae37 100644 (file)
--- a/krylov_multi.tex
+++ b/krylov_multi.tex
@@ -14,6 +14,10 @@
 \maketitle
 
 
 \maketitle
 
 

+%%%%%%%%%%%%%%%%%%%%%%%%
+%%%%%%%%%%%%%%%%%%%%%%%%
+
+

 \begin{abstract}
 In  this  paper we  revist  the  krylov  multisplitting algorithm  presented  in
 \cite{huang1993krylov}  which  uses  a  scalar  method to  minimize  the  krylov
 \begin{abstract}
 In  this  paper we  revist  the  krylov  multisplitting algorithm  presented  in
 \cite{huang1993krylov}  which  uses  a  scalar  method to  minimize  the  krylov


@@ -25,6 +29,11 @@ improvements compared to a classical GMRES both in terms of number of iterations
 and execution times.
 \end{abstract}
 
 and execution times.
 \end{abstract}
 

+
+%%%%%%%%%%%%%%%%%%%%%%%%
+%%%%%%%%%%%%%%%%%%%%%%%%
+
+

 \section{Introduction}
 
 Iterative methods are used to solve  large sparse linear systems of equations of
 \section{Introduction}
 
 Iterative methods are used to solve  large sparse linear systems of equations of


@@ -34,6 +43,21 @@ solving large  linear systems  with many cores,  iterative methods  often suffer
 from  scalability  problems.    This  is  due  to  their   need  for  collective
 communications to perform matrix-vector products and reduction operations.
 
 from  scalability  problems.    This  is  due  to  their   need  for  collective
 communications to perform matrix-vector products and reduction operations.
 

+%%%%% Lilia
+% doit-on définir le principe et les préliminaires du multisplitting dans l'intro ou dans l'autre section? 
+% valides-tu le titre de la 2eme section? celle que je voudrai rédiger.
+
+
+%%%%%%%%%%%%%%%%%%%%%%%%
+%%%%%%%%%%%%%%%%%%%%%%%%
+
+
+\section{A two-stage method with a minimization}
+
+
+%%%%%%%%%%%%%%%%%%%%%%%%
+%%%%%%%%%%%%%%%%%%%%%%%%
+

 \bibliographystyle{plain}
 \bibliography{biblio}
 
 \bibliographystyle{plain}
 \bibliography{biblio}