\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
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
