-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
-GRMES or FGMRES (Flexible GMRES)~\cite{Saad:1993} is used to solve the linear
-system. According to the matrices, different preconditioner is used. With
-TSIRM, the same solver and the same preconditionner are used. This Table shows
-that TSIRM 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.
+systems obtained with the previous matrices with a GMRES variant and with TSIRM
+are given. In the second column, it can be noticed that either GRMES or FGMRES
+(Flexible GMRES)~\cite{Saad:1993} is used to solve the linear system. According
+to the matrices, different preconditioner is used. With TSIRM, the same solver
+and the same preconditionner are used. This Table shows that TSIRM 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.