From: couturie <couturie@extinction>
Date: Wed, 15 Jan 2014 21:13:02 +0000 (+0100)
Subject: suite
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/Krylov_multi.git/commitdiff_plain/d9105f3cc518086be070a250845823a6ec0f7b4a

suite
---

diff --git a/krylov_multi.tex b/krylov_multi.tex
index ea6cfe9..0ff9175 100644
--- a/krylov_multi.tex
+++ b/krylov_multi.tex
@@ -61,8 +61,13 @@ solvers.   However, most  of the  good preconditionners  are not  sclalable when
 thousands of cores are used.
 
 
-A completer...
-On ne peut pas parler de tout...\\
+Traditionnal iterative  solvers have  global synchronizations that  penalize the
+scalability.   Two  possible solutions  consists  either  in using  asynchronous
+iterative  methods~\cite{ref18} or  to  use multisplitting  algorithms. In  this
+paper, we will  reconsider the use of a multisplitting  method. In opposition to
+traditionnal  multisplitting  method  that  suffer  from  slow  convergence,  as
+proposed  in~\cite{huang1993krylov},  the  use  of a  minimization  process  can
+drastically improve the convergence.