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

diff --git a/paper.tex b/paper.tex
index dd1ff68..3a51e45 100644
--- a/paper.tex
+++ b/paper.tex
@@ -623,8 +623,9 @@ solved using only $m$
 iterations of an iterative method, this latter being initialized with the 
 last obtained approximation. 
 GMRES method~\cite{Saad86}, or any of its variants, can potentially be used as
-inner solver. The current approximation of the Krylov method is then stored inside a matrix
-$S$ composed by the successive solutions that are computed during inner iterations.
+inner solver. The current approximation of the Krylov method is then stored inside a $n \times s$ matrix
+$S$, which is composed by the $s$ last solutions that have been computed during 
+the inner iterations phase.
 
 At each $s$ iterations, the minimization step is applied in order to
 compute a new  solution $x$. For that, the previous  residuals of $Ax=b$ are computed by