X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper2.git/blobdiff_plain/2c8490c6d1f44464682f315ff67bcb96b7e8296b..4077d2ba4f6281ac5e2f0c28dcece60c89e333c1:/paper.tex?ds=sidebyside

diff --git a/paper.tex b/paper.tex
index 8203ed0..61f4778 100644
--- a/paper.tex
+++ b/paper.tex
@@ -21,7 +21,7 @@
 
 \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\\
@@ -203,7 +203,7 @@ Using the logarithm  and the exponential operators, we can replace any multiplic
 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