From: Kahina Date: Wed, 4 Nov 2015 10:27:06 +0000 (+0100) Subject: 'exp.log' au lieu de 'log-exp' X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper1.git/commitdiff_plain/32ec94fcc6d75033e57f9e3596add87b2f51585f?ds=inline;hp=-c 'exp.log' au lieu de 'log-exp' --- 32ec94fcc6d75033e57f9e3596add87b2f51585f diff --git a/paper.tex b/paper.tex index e3dde6e..cc7a590 100644 --- a/paper.tex +++ b/paper.tex @@ -731,19 +731,19 @@ For that, we notice that the maximum number of threads per block for the Nvidia The figure 2 show that, the best execution time for both sparse and full polynomial are given when the threads number varies between 64 and 256 threads per bloc. We notice that with small polynomials the best number of threads per block is 64, Whereas, the large polynomials the best number of threads per block is 256. However,In the following experiments we specify that the number of thread by block is 256. -\subsection{The impact of exp-log solution to compute very high degrees of polynomial} +\subsection{The impact of exp.log solution to compute very high degrees of polynomial} -In this experiment we report the performance of log.exp solution describe in ~\ref{sec2} to compute very high degrees polynomials. +In this experiment we report the performance of exp.log solution describe in ~\ref{sec2} to compute very high degrees polynomials. \begin{figure}[htbp] \centering \includegraphics[width=0.8\textwidth]{figures/sparse_full_explog} -\caption{The impact of exp-log solution to compute very high degrees of polynomial.} +\caption{The impact of exp.log solution to compute very high degrees of polynomial.} \label{fig:03} \end{figure} -The figure 3, show a comparison between the execution time of the Ehrlich-Aberth algorithm applying exp.log solution and the execution time of the Ehrlich-Aberth algorithm without applying exp.log solution, with full and sparse polynomials degrees. We can see that the execution time for the both algorithms are the same while the full polynomials degrees are less than 4000 and full polynomials are less than 150,000. After,we show clearly that the classical version of Ehrlich-Aberth algorithm (without applying log.exp) stop to converge and can not solving any polynomial sparse or full. In counterpart, the new version of Ehrlich-Aberth algorithm (applying log.exp solution) can solve very high and large full polynomial exceed 100,000 degrees. +The figure 3, show a comparison between the execution time of the Ehrlich-Aberth algorithm applying exp.log solution and the execution time of the Ehrlich-Aberth algorithm without applying exp.log solution, with full and sparse polynomials degrees. We can see that the execution time for the both algorithms are the same while the full polynomials degrees are less than 4000 and full polynomials are less than 150,000. After,we show clearly that the classical version of Ehrlich-Aberth algorithm (without applying exp.log) stop to converge and can not solving any polynomial sparse or full. In counterpart, the new version of Ehrlich-Aberth algorithm (applying exp.log solution) can solve very high and large full polynomial exceed 100,000 degrees. -in fact, when the modulus of the roots are up than \textit{R} given in ~\ref{R},this exceed the limited number in the mantissa of floating points representations and can not compute the iterative function given in ~\ref{eq:Aberth-H-GS} to obtain the root solution, who justify the divergence of the classical Ehrlich-Aberth algorithm. However, applying log.exp solution given in ~\ref{sec2} took into account the limit of floating using the iterative function in(Eq.~\ref{Log_H1},Eq.~\ref{Log_H2} and allows to solve a very large polynomials degrees . +in fact, when the modulus of the roots are up than \textit{R} given in ~\ref{R},this exceed the limited number in the mantissa of floating points representations and can not compute the iterative function given in ~\ref{eq:Aberth-H-GS} to obtain the root solution, who justify the divergence of the classical Ehrlich-Aberth algorithm. However, applying exp.log solution given in ~\ref{sec2} took into account the limit of floating using the iterative function in(Eq.~\ref{Log_H1},Eq.~\ref{Log_H2} and allows to solve a very large polynomials degrees .