From 0f544a712fbfaa8e36e2d89273b1ecf21085669c Mon Sep 17 00:00:00 2001 From: Christophe Guyeux Date: Fri, 10 Oct 2014 16:25:40 +0200 Subject: [PATCH] Relecture --- paper.tex | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) 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 -- 2.39.5