From f906225644f3d763193e909f019cce9455984280 Mon Sep 17 00:00:00 2001 From: lilia Date: Thu, 9 Oct 2014 16:44:15 +0200 Subject: [PATCH 1/1] 09-10-2014 01 --- paper.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/paper.tex b/paper.tex index f64255d..e7e7e0d 100644 --- a/paper.tex +++ b/paper.tex @@ -615,7 +615,7 @@ points of our solver are given in Algorithm~\ref{algo:01}. In order to accelerate the convergence, the outer iteration periodically applies a least-square minimization on the residuals computed by the inner solver. The -inner solver is a Krylov based solver which does not required to be changed. +inner solver is based on a Krylov method which does not require to be changed. At each outer iteration, the sparse linear system $Ax=b$ is solved, only for $m$ iterations, using an iterative method restarting with the previous solution. For -- 2.39.5