\title{Two parallel implementations of Ehrlich-Aberth algorithm for root-finding of polynomials on multiple GPUs with OpenMP and MPI}
-\author{\IEEEauthorblockN{Kahina Guidouche, Abderrahmane Sider }
+\author{\IEEEauthorblockN{Kahina Ghidouche, Abderrahmane Sider }
\IEEEauthorblockA{Laboratoire LIMED\\
Faculté des sciences exactes\\
Université de Bejaia, 06000, Algeria\\
The code is organized as kernels which are parts of code that are run
on GPU devices. Algorithm~\ref{alg1-cuda} describes the CUDA
implementation of the Ehrlich-Aberth on a GPU. This algorithms starts
-by initializinf the polynomial and its derivative (line 1). The
+by initializing the polynomial and its derivative (line 1). The
initialization of the roots is performed (line 2). Data are transfered
from the CPU to the GPU (after allocation of the required memory on
the GPU) (line 3). Then at each iteration, if the error is greater
