Merge

[GMRES2stage.git] / paper.tex

diff --git a/paper.tex b/paper.tex
index 1d4cac09f311bc2942f5bc0278957528aa0c19a3..b08750d9341141e92504651cb38ae9b3fcab7c99 100644 (file)
--- a/paper.tex
+++ b/paper.tex
@@ -748,7 +748,7 @@ the convergence of GMRES($m$) for all $m$ under that assumption regarding $A$.
 
 We can now claim that,
 \begin{proposition}
-If $A$ is a positive real matrix, then the TSIRM algorithm is convergent.
+If $A$ is a positive real matrix and GMRES($m$) is used as solver, then the TSIRM algorithm is convergent.
 \end{proposition}
 
 \begin{proof}
@@ -756,7 +756,7 @@ Let $r_k = b-Ax_k$, where $x_k$ is the approximation of the solution after the
 $k$-th iterate of TSIRM.
 We will prove that $r_k \rightarrow 0$ when $k \rightarrow +\infty$.
 
-
+Each step of the TSIRM algorithm 
 \end{proof}
 
 %%%*********************************************************