X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/GMRES2stage.git/blobdiff_plain/49d3ad986610c9438c522b61b9c1f57ebe4b824e..dc78d221932044772c633e437e2cd905d13ed269:/IJHPCN/paper.tex

diff --git a/IJHPCN/paper.tex b/IJHPCN/paper.tex
index abe4b2d..61d09cf 100644
--- a/IJHPCN/paper.tex
+++ b/IJHPCN/paper.tex
@@ -49,9 +49,7 @@
 \makeatletter
 \def\theequation{\arabic{equation}}
 
-%\JOURNALNAME{\TEN{\it Int. J. System Control and Information
-%Processing,
-%Vol. \theVOL, No. \theISSUE, \thePUBYEAR\hfill\thepage}}%
+\JOURNALNAME{\TEN{\it International Journal of High Performance Computing and Networking}}
 %
 %\def\BottomCatch{%
 %\vskip -10pt
@@ -109,19 +107,25 @@ Data}
 
 
 \begin{abstract}
-In  this article, a  two-stage iterative  algorithm is  proposed to  improve the
+In  this paper,  a  two-stage iterative  algorithm is  proposed  to improve  the
 convergence  of  Krylov  based  iterative  methods,  typically  those  of  GMRES
-variants.  The  principle of  the  proposed approach  is  to  build an  external
-iteration over the  Krylov method, and to frequently  store its current residual
+variants.   The principle  of  the proposed  approach is  to  build an  external
+iteration over the  Krylov method, and to frequently store  its current residual
 (at each GMRES restart for instance).  After a given number of outer iterations,
 a least-squares minimization step is applied on the matrix composed by the saved
-residuals, in order  to compute a better solution and to  make new iterations if
-required.  It  is proven that the  proposal has the  same convergence properties
-than the  inner embedded  method itself.  Experiments  using up to  16,394 cores
-also  show that the  proposed algorithm  runs around  5 or  7 times  faster than
-GMRES.
+residuals, in order to  compute a better solution and to  make new iterations if
+required.  It  is proven that the  proposal has the same  convergence properties
+than the inner  embedded method itself.
+%%NEW
+Several experiments  have been performed
+with  the PETSc  solver  with  linear and  nonlinear  problems.  They show  good
+speedups   compared  to   GMRES  with   up  to   16,394  cores   with  different
+preconditioners.
+%%ENDNEW
 \end{abstract}
 
+
+
 \KEYWORD{Iterative Krylov methods; sparse linear and non linear systems; two stage iteration; least-squares residual minimization; PETSc.}
 
 %\REF{to this paper should be made as follows: Rodr\'{\i}guez
@@ -131,28 +135,11 @@ GMRES.
 %Semantics and Ontologies}, Vol. x, No. x, pp.xxx\textendash xxx.}
 
 \begin{bio}
-Manuel Pedro Rodr\'iguez Bol\'ivar received his PhD in Accounting at
-the University of Granada. He is a Lecturer at the Department of
-Accounting and Finance, University of Granada. His research
-interests include issues related to conceptual frameworks of
-accounting, diffusion of financial information on Internet, Balanced
-Scorecard applications and environmental accounting. He is author of
-a great deal of research studies published at national and
-international journals, conference proceedings as well as book
-chapters, one of which has been edited by Kluwer Academic
-Publishers.\vs{9}
-
-\noindent Bel\'en Sen\'es Garc\'ia received her PhD in Accounting at
-the University of Granada. She is a Lecturer at the Department of
-Accounting and Finance, University of Granada. Her research
-interests are related to cultural, institutional and historic
-accounting and in environmental accounting. She has published
-research papers at national and international journals, conference
-proceedings as well as chapters of books.\vs{8}
-
-\noindent Both authors have published a book about environmental
-accounting edited by the Institute of Accounting and Auditing,
-Ministry of Economic Affairs, in Spain in October 2003.
+Raphaël Couturier ....
+
+\noindent Lilia Ziane Khodja ...
+
+\noindent Christophe Guyeux ...
 \end{bio}