From 8a4b92e599025f524c0896cb5b2cbdcaec817133 Mon Sep 17 00:00:00 2001 From: raphael couturier Date: Thu, 9 Oct 2014 17:20:14 +0200 Subject: [PATCH] update --- paper.tex | 13 ++++++------- 1 file changed, 6 insertions(+), 7 deletions(-) diff --git a/paper.tex b/paper.tex index 18340f6..32b52db 100644 --- a/paper.tex +++ b/paper.tex @@ -776,13 +776,12 @@ In Table~\ref{tab:02}, some experiments comparing the solving of the linear systems obtained with the previous matrices with a GMRES variant and with out 2 stage algorithm are given. In the second column, it can be noticed that either gmres or fgmres is used to solve the linear system. According to the matrices, -different preconditioner is used. With the 2 stage algorithm, the same solver -and the same preconditionner is used. This Table shows that the 2 stage -algorithm can drastically reduce the number of iterations to reach the -convergence when the number of iterations for the normal GMRES is more or less -greater than 500. In fact this also depends on tow parameters: the number of -iterations to stop GMRES and the number of iterations to perform the -minimization. +different preconditioner is used. With TSARM, the same solver and the same +preconditionner is used. This Table shows that TSARM can drastically reduce the +number of iterations to reach the convergence when the number of iterations for +the normal GMRES is more or less greater than 500. In fact this also depends on +tow parameters: the number of iterations to stop GMRES and the number of +iterations to perform the minimization. \begin{table} -- 2.39.5