X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/GMRES2stage.git/blobdiff_plain/e038522489b4db01b21bd9191355cb18bd619431..71945acdf6349140c37f80c298c1305f72fc2482:/paper.tex

diff --git a/paper.tex b/paper.tex
index ddfba59..1f6d783 100644
--- a/paper.tex
+++ b/paper.tex
@@ -609,9 +609,10 @@ In order to enhance the robustness of Krylov iterative solvers, some techniques
 
 Recently, communication-avoiding methods have been developed to reduce the communication overheads in Krylov subspace iterative solvers. On modern computer architectures, communications between processors are much slower than floating-point arithmetic operations on a given processor. Communication-avoiding techniques reduce either communications between processors or data movements between levels of the memory hierarchy, by reformulating the communication-bound kernels (more frequently SpMV kernels) and the orthogonalization operations within the Krylov iterative solver. Different works have studied the communication-avoiding methods for multicore processors and multi-GPU machines~\cite{}. 
 
-Compared to all  these works, the originality  of our work is to  build a second
-iteration over  a Krylov iterative method  and to minimize the  residuals with a
-least-squares method after a given number of outer iteration.
+Compared  to all these  works and  to all  the other  works on  Krylov iterative
+method, the originality of our work is to build a second iteration over a Krylov
+iterative method and to minimize the residuals with a least-squares method after
+a given number of outer iteration.
 
 %%%*********************************************************
 %%%*********************************************************
