From: lilia Date: Fri, 10 Oct 2014 08:14:03 +0000 (+0200) Subject: 10-10-2014 02 X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/GMRES2stage.git/commitdiff_plain/299e2e52d19b38d91f622d1eb8b7af2bb44c7685 10-10-2014 02 --- diff --git a/paper.tex b/paper.tex index 54e35d3..4757973 100644 --- a/paper.tex +++ b/paper.tex @@ -754,7 +754,7 @@ In order to see the influence of our algorithm with only one processor, we first show a comparison with the standard version of GMRES and our algorithm. In Table~\ref{tab:01}, we show the matrices we have used and some of them characteristics. For all the matrices, the name, the field, the number of rows -and the number of nonzero elements is given. +and the number of nonzero elements are given. \begin{table}[htbp] \begin{center} @@ -777,7 +777,7 @@ torso3 & 2D/3D problem & 259,156 & 4,429,042 \\ The following parameters have been chosen for our experiments. As by default the restart of GMRES is performed every 30 iterations, we have chosen to stop -the GMRES every 30 iterations, $max\_iter_{kryl}=30$). $s$ is set to 8. CGLS is +the GMRES every 30 iterations (\emph{i.e.} $max\_iter_{kryl}=30$). $s$ is set to 8. CGLS is chosen to minimize the least-squares problem with the following parameters: $\epsilon_{ls}=1e-40$ and $max\_iter_{ls}=20$. The external precision is set to $\epsilon_{tsirm}=1e-10$. Those experiments have been performed on a Intel(R)