-%%HIER END MY REVISIONS (SIDER)
\section{Experimental study}
\label{sec6}
%\subsection{Definition of the used polynomials }
\label{fig:01}
\end{figure}
%%Figure 1 %%show a comparison of execution time between the parallel and sequential version of the Ehrlich-Aberth algorithm with sparse polynomial exceed 100000,
-In Figure~\ref{fig:01}, we report respectively the execution time of the Ehrlich-Aberth method implemented initially on one core of the Quad-Core Xeon E5620 CPU than on four cores of the same machine with \textit{OpenMP} platform and the execution time of the same method implemented on one Nvidia Tesla K40c GPU, with sparse polynomial degrees ranging from 100,000 to 1,000,000. We can see that the method implemented on the GPU are faster than those implemented on the CPU (4 cores). This is due to the GPU ability to compute the data-parallel functions faster than its CPU counterpart. However, the execution time for the CPU(4 cores) implementation exceed 5,000 s for 250,000 degrees polynomials, in counterpart the GPU implementation for the same polynomials not reach 100 s, more than again, with an execution time under to 2,500 s CPU (4 cores) implementation can resolve polynomials degrees of only 200,000, whereas GPU implementation can resolve polynomials more than 1,000,000 degrees. We can also notice that the GPU implementation are almost 47 faster then those implementation on the CPU(4 cores). However the CPU(4 cores) implementation are almost 4 faster then his implementation on CPU (1 core). Furthermore, we verify that the number of iterations and the convergence precision is the same for the both CPU and GPU implementation. %This reduction of time allows us to compute roots of polynomial of more important degree at the same time than with a CPU.
+In Figure~\ref{fig:01}, we report the execution times of the
+Ehrlich-Aberth method on one core of a Quad-Core Xeon E5620 CPU, on
+four cores on the same machine with \textit{OpenMP} and on a Nvidia
+Tesla K40c GPU. We chose different sparse polynomials with degrees
+ranging from 100,000 to 1,000,000. We can see that the implementation
+on the GPU is faster than those implemented on the CPU.
+
+This is due to the GPU ability to compute the data-parallel functions
+faster than its CPU counterpart. However, the execution time for the
+CPU (4 cores) implementation exceed 5,000s for 250,000 degrees
+polynomials. In counterpart, the GPU implementation for the same
+polynomials do not take more 100s. With the GPU
+we can solve high degrees polynomials very quickly up to degree
+of 1,000,000. We can also notice that the GPU implementation are
+almost 47 faster then those implementation on the CPU (4
+cores). However the CPU (4 cores) implementation are almost 4 faster
+then his implementation on CPU (1 core). Furthermore, the number of
+iterations and the convergence precision are similar with the CPU
+and the GPU implementation.
+
+%%This reduction
+%of time allows us to compute roots of polynomial of more important
+%degree at the same time than with a CPU.
%We notice that the convergence precision is a round $10^{-7}$ for the both implementation on CPU and GPU. Consequently, we can conclude that Ehrlich-Aberth on GPU are faster and accurately then CPU implementation.
