new

diff --git a/krylov_multi.tex b/krylov_multi.tex
index 5a736703be2507a04a0fa4cc485d8d7423b9c473..5715dc24479cbde273a2150e1acbb36ec339573f 100644 (file)
--- a/krylov_multi.tex
+++ b/krylov_multi.tex
@@ -38,7 +38,7 @@
 
 \begin{abstract}
 In  this paper  we  revisit  the Krylov  multisplitting  algorithm presented  in
 
 \begin{abstract}
 In  this paper  we  revisit  the Krylov  multisplitting  algorithm presented  in

-\cite{huang1993krylov}  which  uses  a  scalar  method to  minimize  the  Krylov
+\cite{huang1993krylov}  which  uses  a  sequential  method to  minimize  the  Krylov

 iterations computed by a multisplitting algorithm. Our new algorithm is based on
 a  parallel multisplitting  algorithm  with few  blocks  of large  size using  a
 parallel GMRES method inside each block and on a parallel Krylov minimization in
 iterations computed by a multisplitting algorithm. Our new algorithm is based on
 a  parallel multisplitting  algorithm  with few  blocks  of large  size using  a
 parallel GMRES method inside each block and on a parallel Krylov minimization in


@@ -97,7 +97,7 @@ convergence of the global system.
 
 In~\cite{couturier2008gremlins}, the  authors proposed practical implementations
 of multisplitting algorithms to solve  large scale linear systems. Inner solvers
 
 In~\cite{couturier2008gremlins}, the  authors proposed practical implementations
 of multisplitting algorithms to solve  large scale linear systems. Inner solvers

-could be  based on scalar direct method  with the LU method  or scalar iterative
+could be  based on sequential direct method  with the LU method  or sequential iterative

 one with GMRES.
 
 In~\cite{prace-multi},  the  authors have  proposed a  parallel  multisplitting
 one with GMRES.
 
 In~\cite{prace-multi},  the  authors have  proposed a  parallel  multisplitting