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

diff --git a/paper.tex b/paper.tex
index fb32347..0c0299f 100644
--- a/paper.tex
+++ b/paper.tex
@@ -431,7 +431,7 @@ Email: lilia.ziane@inria.fr}
 \end{abstract}
 
 \begin{IEEEkeywords}
-Iterative Krylov methods; sparse linear systems; error minimization; PETSC; %à voir... 
+Iterative Krylov methods; sparse linear systems; error minimization; PETSc; %à voir... 
 \end{IEEEkeywords}
 
 
@@ -544,10 +544,9 @@ The most successful iterative methods currently available are those based on Kry
 
 However, the iterative methods suffer from scalability problems on parallel computing platforms with many processors due to their need for reduction operations and collective communications to perform matrix-vector multiplications. The communications on large clusters with thousands of cores and large sizes of messages can significantly affect the performances of iterative methods. In practice, Krylov subspace iteration methods are often used with preconditioners in order to increase their convergence and accelerate their performances. However, most of the good preconditioners are not scalable on large clusters. 
 
-In this paper we propose a two-stage algorithm, also called inner-outer iteration algorithm, based on two nested iterations.  
-
-This paper is organized as follows. In Section~\ref{sec:02} some related works are presented. Section~\ref{sec:03} presents our two-stage algorithm based on Krylov subspace iteration methods. Section~\ref{sec:04} shows some experimental results obtained on large clusters using routines of PETSC toolkit.    
+In this paper we propose a two-stage algorithm based on two nested iterations called inner-outer iterations. The algorithm consists in solving the sparse linear system iteratively with a small number of inner iterations and restarts the outer step with a new solution minimizing some error function over a Krylov subspace. The algorithm is iterative and easy to parallelize on large clusters and the minimization technique improves its convergence and performances.
 
+The present paper is organized as follows. In Section~\ref{sec:02} some related works are presented. Section~\ref{sec:03} presents our two-stage algorithm based on Krylov subspace iteration methods. Section~\ref{sec:04} shows some experimental results obtained on large clusters of our algorithm using routines of PETSc toolkit.  
 %%%*********************************************************
 %%%*********************************************************
 
@@ -569,7 +568,7 @@ This paper is organized as follows. In Section~\ref{sec:02} some related works a
 \label{sec:03}
 We propose a two-stage algorithm to solve large sparse linear systems of the form $Ax=b$, where $A\in\mathbb{R}^{n\times n}$ is a sparse and square nonsingular matrix, $x\in\mathbb{R}^n$ is the solution vector and $b\in\mathbb{R}^n$ is the right-hand side. The algorithm is implemented as an inner-outer iteration solver based on iterative Krylov methods. The main key points of our solver are given in Algorithm~\ref{algo:01}. 
 
-In order to accelerate the convergence, the outer iteration is implemented as an iterative Krylov method which minimizes some error function over a Krylov subspace~\cite{saad96}. At every iteration, the sparse linear system $Ax=b$ is solved iteratively with an iterative method as GMRES method~\cite{saad86} and the Krylov subspace that we used is spanned by a basis $S$ composed of successive solutions issued from the inner iteration
+In order to accelerate the convergence, the outer iteration is implemented as an iterative Krylov method which minimizes some error function over a Krylov subspace~\cite{saad96}. At every iteration, the sparse linear system $Ax=b$ is solved iteratively with an iterative method for example GMRES method~\cite{saad86} and the Krylov subspace that we used is spanned by a basis $S$ composed of successive solutions issued from the inner iteration
 \begin{equation}
   S = \{x^1, x^2, \ldots, x^s\} \text{,~} s\leq n.
 \end{equation}