X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/GMRES2stage.git/blobdiff_plain/9fda9aa7b779d8ce482f4ecf1a6d1623cee17fc2..188fd5ea609ede88fe86f45867ef1fd8a0638706:/paper.tex

diff --git a/paper.tex b/paper.tex
index 4f1da9b..9f8ded7 100644
--- a/paper.tex
+++ b/paper.tex
@@ -672,7 +672,7 @@ equals to  the restart  number of the  GMRES-like method. Moreover,  a tolerance
 threshold must be specified for the  solver. In practice, this threshold must be
 much  smaller  than the  convergence  threshold  of  the TSARM  algorithm  (\emph{i.e.}
 $\epsilon_{tsarm}$).  Line~\ref{algo:store}, $S_{k~ mod~ s}=x^k$ consists in copying the
-solution  $x_k$  into the  column  $k~  mod~Â s$ of  the  matrix  $S$. After  the
+solution  $x_k$  into the  column  $k~ mod~ s$ of  the  matrix  $S$. After  the
 minimization, the matrix $S$ is reused with the new values of the residuals.  To
 solve the minimization problem, an  iterative method is used. Two parameters are
 required for that: the maximum number of iteration and the threshold to stop the
