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

diff --git a/paper.tex b/paper.tex
index 59c5600..ddfba59 100644
--- a/paper.tex
+++ b/paper.tex
@@ -609,6 +609,9 @@ 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.
 
 %%%*********************************************************
 %%%*********************************************************