X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/Krylov_multi.git/blobdiff_plain/524e5307718f3e827dd7f46e952a285dca7b4d73..fe229ad3b51b8d0e3178dcea2f8a3c5d1bb2d30d:/krylov_multi_reviewed.tex?ds=inline

diff --git a/krylov_multi_reviewed.tex b/krylov_multi_reviewed.tex
index cdcaae2..3345894 100644
--- a/krylov_multi_reviewed.tex
+++ b/krylov_multi_reviewed.tex
@@ -99,7 +99,7 @@ process can drastically improve the convergence.\\
 %%% AJOUTE************************
 %%%*******************************
 \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.\\
+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 other 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.\\
 %%%*******************************
 %%%*******************************
 
