From: couturie <couturie@extinction>
Date: Tue, 17 Dec 2013 13:28:58 +0000 (+0100)
Subject: Merge branch 'master' of ssh://info.iut-bm.univ-fcomte.fr/Krylov_multi
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/Krylov_multi.git/commitdiff_plain/87f15fb45ae134cbf1e3a43b7ffc2a19218487ee?hp=70c44690f5342df3f1f809bf2bf5565a1e50f6ff

Merge branch 'master' of ssh://info.iut-bm.univ-fcomte.fr/Krylov_multi
---

diff --git a/krylov_multi.tex b/krylov_multi.tex
index 0fd3b79..ad465ee 100644
--- a/krylov_multi.tex
+++ b/krylov_multi.tex
@@ -14,6 +14,10 @@
 \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
@@ -25,6 +29,11 @@ problem  are presented.   They  show  the obtained  improvements  compared to  a
 classical GMRES both in terms of number of iterations and execution times.
 \end{abstract}
 
+
+%%%%%%%%%%%%%%%%%%%%%%%%
+%%%%%%%%%%%%%%%%%%%%%%%%
+
+
 \section{Introduction}
 
 Iterative methods are used to solve  large sparse linear systems of equations of
@@ -66,6 +75,21 @@ of multisplitting algorithms that take benefit from multisplitting algorithms to
 solve large scale linear systems. Inner  solvers could be based on scalar direct
 method with the LU method or scalar iterative one with GMRES.
 
+%%%%% 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}