X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/GMRES2stage.git/blobdiff_plain/26d38e217c09735a23eb667846b3869559154681..cb1a9d12f517e4be109bb4ccc9d74d897725d5ec:/IJHPCN/paper.tex

diff --git a/IJHPCN/paper.tex b/IJHPCN/paper.tex
index 2e4cfb6..0d6849d 100644
--- a/IJHPCN/paper.tex
+++ b/IJHPCN/paper.tex
@@ -876,28 +876,20 @@ Concerning the  experiments some  other remarks are  interesting.
 %%%*********************************************************
 %%%*********************************************************
 
-A new two-stage iterative  algorithm TSIRM has been proposed in this article,
-in order to accelerate the convergence of Krylov iterative  methods.
-Our TSIRM proposal acts as a merger between Krylov based solvers and
-a least-squares minimization step.
-The convergence of the method has been proven in some situations, while 
-experiments up to 16,394 cores have been led to verify that TSIRM runs
-5 or  7 times  faster than GMRES.
-
-
-For  future  work, the  authors'  intention is  to  investigate  other kinds  of
-matrices, problems, and  inner solvers. In particular, the possibility 
-to obtain a convergence of TSIRM in situations where the GMRES is divergent will be
-investigated. The influence of  all parameters must be
-tested too, while other methods to minimize the residuals must be regarded.  The
-number of outer  iterations to minimize should become  adaptive to improve the
-overall performances of the proposal.   Finally, this solver will be implemented
-inside PETSc, which would be of interest as it would  allows us to test
-all the non-linear  examples and compare our algorithm  with the other algorithm
-implemented in PETSc.
-
-
-% conference papers do not normally have an appendix
+%%NEW
+In this paper a new two-stage algorithm TSIRM has been described. This method allows us to improve the convergence of  Krylov iterative  methods. It is based
+on a least-squares minimization step which uses the  Krylov residuals.
+
+
+We have implemented our code in PETSc in order to show that it is efficient and scalable. Some experiments with classical examples of PETSc for linear and nonlinear problems have been performed. We observed that TSIRM outperforms GMRES variants when the number of iterations is large. TSIRM is also scalable since we made some experiments with up to 16,394 cores.
+
+We also observed that TSIRM is efficient with different preconditioners. The hypre preconditioner that is globally very efficient for many problems is also very time consuming. Consequently, sometimes using a less performent preconditioners may be a better solution. In that case, TSIRM is also more efficient than traditional Krylov methods.
+
+{\bf A CHECKER !!}
+The influence of some important parameters of TSIRM have been studied. It can be noticed that they have a strong influence on the convergence speed
+
+In future works, we plan to study other problems coming from different research areas. Other efficient Krylov optimisation methods as communication avoiding technique may be interesting to be investigated
+%%ENDNEW
 
 
 
