X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper1.git/blobdiff_plain/d01b38b825b4f5d811d42fc1904be2e7bd85883f..c18407ffc4e9394dd7573d81b3109ec0136dc7ce:/paper.tex

diff --git a/paper.tex b/paper.tex
index dde98e9..e1dfd58 100644
--- a/paper.tex
+++ b/paper.tex
@@ -772,6 +772,13 @@ methods on GPU. We took into account the execution time, the number of iteration
 \label{fig:04}
 \end{figure}
 
+\begin{figure}[htbp]
+\centering
+  \includegraphics[width=0.8\textwidth]{figures/EA_DK1}
+\caption{Execution times of the  Durand-Kerner and the Ehrlich-Aberth methods on GPU}
+\label{fig:0}
+\end{figure}
+
 Figure~\ref{fig:04} shows the execution times of both methods with
 sparse polynomial degrees ranging from 1,000 to 1,000,000. We can see
 that the Ehrlich-Aberth algorithm is faster than Durand-Kerner