X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/Krylov_multi.git/blobdiff_plain/774e3ae76fae2fcab8efe8bf6bc2b61c0da65e09..8dec794b01b4893a1ccc93250b6108a852feb2f7:/krylov_multi.tex?ds=sidebyside

diff --git a/krylov_multi.tex b/krylov_multi.tex
index 8685bd2..61c1e28 100644
--- a/krylov_multi.tex
+++ b/krylov_multi.tex
@@ -14,6 +14,7 @@
 
 
 \title{A scalable multisplitting algorithm for solving large sparse linear systems} 
+\date{}
 
 
 
@@ -208,7 +209,7 @@ the  vectors  $X_i$  represent   the  data  dependencies  between  the
 clusters. In this work,  we use the parallel GMRES method~\cite{ref34}
 as     an     inner      iteration     method     to     solve     the
 sub-systems~(\ref{sec03:eq03}).  It  is a well-known  iterative method
-which  gives good performances  for solving  sparse linear  systems in
+which  gives good performances  to solve  sparse linear  systems in
 parallel on a cluster of processors.
 
 It should be noted that  the convergence of the inner iterative solver
