X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper1.git/blobdiff_plain/407f6448703e5d6ae4aa91a11ac80ffa92414bce..d01b38b825b4f5d811d42fc1904be2e7bd85883f:/paper.tex?ds=sidebyside

diff --git a/paper.tex b/paper.tex
index cf26c41..dde98e9 100644
--- a/paper.tex
+++ b/paper.tex
@@ -583,7 +583,7 @@ Algorithm~\ref{alg2-cuda} shows a sketch of the Ehrlich-Aberth algorithm using C
 \caption{CUDA Algorithm to find roots with the Ehrlich-Aberth method}
 
 \KwIn{$Z^{0}$ (Initial root's vector), $\varepsilon$ (error tolerance
-  threshold), P(Polynomial to solve), Pu (the derivative of P), $n$ (Polynomial's degrees),$\Delta z_{max}$ (maximum value of stop condition)}
+  threshold), P(Polynomial to solve), Pu (the derivative of P), $n$ (Polynomial's degrees), $\Delta z_{max}$ (maximum value of stop condition)}
 
 \KwOut {$Z$ (The solution root's vector), $ZPrec$ (the previous solution root's vector)}
 
@@ -592,14 +592,14 @@ Algorithm~\ref{alg2-cuda} shows a sketch of the Ehrlich-Aberth algorithm using C
 Initialization of the of P\;
 Initialization of the of Pu\;
 Initialization of the solution vector $Z^{0}$\;
-Allocate and copy initial data to the GPU global memory ($d\_Z,d\_ZPrec,d\_P,d\_Pu$)\;
+Allocate and copy initial data to the GPU global memory\;
 k=0\;
 \While {$\Delta z_{max} > \epsilon$}{
  Let $\Delta z_{max}=0$\;
-$ kernel\_save(d\_ZPrec,d\_Z)$\;
+$ kernel\_save(ZPrec,Z)$\;
 k=k+1\;
-$ kernel\_update(d\_Z,d\_P,d\_Pu)$\;
-$kernel\_testConverge(\Delta z_{max},d\_Z,d\_ZPrec)$\;
+$ kernel\_update(Z,P,Pu)$\;
+$kernel\_testConverge(\Delta z_{max},Z,ZPrec)$\;
 
 }
 Copy results from GPU memory to CPU memory\;
@@ -619,10 +619,10 @@ exponential logarithm algorithm.
 %\LinesNumbered
 \caption{Kernel update}
 
-\eIf{$(\left|d\_Z\right|<= R)$}{
-$kernel\_update((d\_Z,d\_P,d\_Pu)$\;}
+\eIf{$(\left|Z\right|<= R)$}{
+$kernel\_update((Z,P,Pu)$\;}
 {
-$kernel\_update\_ExpoLog((d\_Z,d\_P,\_Pu))$\;
+$kernel\_update\_ExpoLog((Z,P,Pu))$\;
 }
 \end{algorithm}
 
@@ -734,7 +734,7 @@ The figure 2 show that, the best execution time for both sparse and full polynom
 
 \subsection{The impact of exp.log solution to compute very high degrees of  polynomial}
 
-In this experiment we report the performance of exp.log solution describe in ~\ref{sec2} to compute very high degrees polynomials.   
+In this experiment we report the performance of exp-log solution described in Section~\ref{sec2} to compute very high degrees polynomials.   
 \begin{figure}[htbp]
 \centering
   \includegraphics[width=0.8\textwidth]{figures/sparse_full_explog}
@@ -742,23 +742,44 @@ In this experiment we report the performance of exp.log solution describe in ~\r
 \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 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 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 . 
+Figure~\ref{fig:03} shows a comparison between the execution time of
+the Ehrlich-Aberth algorithm using the exp.log solution and the
+execution time of the Ehrlich-Aberth algorithm without this solution,
+with full and sparse polynomials degrees. We can see that the
+execution times for both algorithms are the same with full polynomials
+degrees less than 4000 and sparse polynomials less than 150,000. We
+also clearly show that the classical version (without log.exp) of
+Ehrlich-Aberth algorithm do not converge after these degree with
+sparse and full polynomials. In counterpart, the new version of
+Ehrlich-Aberth algorithm with the log.exp solution can solve very
+high degree polynomials.
 
+%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 . 
 
 
-\subsection{A comparative study between Ehrlich-Aberth algorithm and Durand-kerner algorithm}
-In this part, we are interesting to compare the simultaneous methods, Ehrlich-Aberth and Durand-Kerner in parallel computer using GPU. We took into account the execution time, the number of iteration and the polynomial's size. for the both sparse and full polynomials.  
+
+
+\subsection{Comparison of the Durand-Kerner and the Ehrlich-Aberth methods}
+
+In this part, we  compare the Durand-Kerner and the Ehrlich-Aberth
+methods on GPU. We took into account the execution time, the number of iteration and the polynomial's size for the both sparse and full polynomials.  
 
 \begin{figure}[htbp]
 \centering
   \includegraphics[width=0.8\textwidth]{figures/EA_DK}
-\caption{The execution time of Ehrlich-Aberth versus Durand-Kerner algorithm on GPU}
+\caption{Execution times of the  Durand-Kerner and the Ehrlich-Aberth methods on GPU}
 \label{fig:04}
 \end{figure}
 
-This figure show the execution time of the both algorithm EA and DK with sparse polynomial degrees ranging from 1000 to 1000000. We can see that the Ehrlich-Aberth algorithm are faster than Durand-Kerner algorithm, with an average of 25 times as fast. Then, when degrees of polynomial exceed 500000 the execution time with EA is of the order 100 whereas DK passes in the order 1000. %with double precision not exceed $10^{-5}$.
+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
+algorithm, with an average of 25 times faster. Then, when degrees of
+polynomial exceed 500000 the execution time with EA is of the order
+100 whereas DK passes in the order 1000.
+
+%with double precision not exceed $10^{-5}$.
 
 \begin{figure}[htbp]
 \centering
