X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper1.git/blobdiff_plain/8f44fe5aa15f1d0795d9c1f5be461a09bc6ca4ca..c90f146cdefa047c69990e5c0d1891ef6def1bc2:/paper.tex?ds=inline

diff --git a/paper.tex b/paper.tex
index 6507d22..c78df7b 100644
--- a/paper.tex
+++ b/paper.tex
@@ -269,10 +269,10 @@ The initialization of a polynomial p(z) is done by setting each of the $n$ compl
 
 \subsection{Vector $z^{(0)}$ Initialization}
 
-Like for any iterative method, we need to choose $n$ initial guess points $z^{(0)}_{i}, i = 1, . . . , n.$
+As for any iterative method, we need to choose $n$ initial guess points $z^{(0)}_{i}, i = 1, . . . , n.$
 The initial guess is very important since the number of steps needed by the iterative method to reach
 a given approximation strongly depends on it.
-In~\cite{Aberth73} the Aberth iteration is started by selecting $n$
+In~\cite{Aberth73} the Ehrlich-Aberth iteration is started by selecting $n$
 equi-spaced points on a circle of center 0 and radius r, where r is
 an upper bound to the moduli of the zeros. Later, Bini and al.~\cite{Bini96}
 performed this choice by selecting complex numbers along different
@@ -303,20 +303,23 @@ Here we give a second form of the iterative function used by Ehrlich-Aberth meth
 EA2: z^{k+1}=z_{i}^{k}-\frac{\frac{p(z_{i}^{k})}{p'(z_{i}^{k})}}
 {1-\frac{p(z_{i}^{k})}{p'(z_{i}^{k})}\sum_{j=1,j\neq i}^{j=n}{\frac{1}{(z_{i}^{k}-z_{j}^{k})}}}, i=0,. . . .,n
 \end{equation}
-we notice that the function iterative in Eq.~\ref{Eq:Hi} it the same those presented in Eq.~\ref{Eq:EA}, but we prefer used the last one seen the advantage of its use to improve the Ehrlich-Aberth method and resolve very high degrees polynomials. More detail in the section ~\ref{sec2}.    
+It can be noticed that this equation is equivalent to Eq.~\ref{Eq:EA},
+but we prefer the latter one because we can use it to improve the
+Ehrlich-Aberth method and find the roots of very high degrees polynomials. More
+details are given in Section ~\ref{sec2}.
 \subsection{Convergence Condition}
-The convergence condition determines the termination of the algorithm. It consists in stopping from running the iterative function  when the roots are sufficiently stable. We consider that the method converges sufficiently when:
+The convergence condition determines the termination of the algorithm. It consists in stopping the iterative function  when the roots are sufficiently stable. We consider that the method converges sufficiently when:
 
 \begin{equation}
 \label{eq:Aberth-Conv-Cond}
-\forall i \in
-[1,n];\frac{z_{i}^{k}-z_{i}^{k-1}}{z_{i}^{k}}<\xi
+\forall i \in [1,n];\vert\frac{z_{i}^{k}-z_{i}^{k-1}}{z_{i}^{k}}\vert<\xi
 \end{equation}
 
 
 \section{Improving the Ehrlich-Aberth Method for high degree polynomials with exp.log formulation}
 \label{sec2}
-The Ehrlich-Aberth method implementation suffers of overflow problems. This
+With high degree polynomial, the Ehrlich-Aberth method implementation,
+as well as the Durand-Kerner implement, suffers from overflow problems. This
 situation occurs, for instance, in the case where a polynomial
 having positive coefficients and a large degree is computed at a
 point $\xi$ where $|\xi| > 1$, where $|x|$ stands for the modolus of a complex $x$. Indeed, the limited number in the
@@ -344,7 +347,7 @@ Using the logarithm (eq.~\ref{deflncomplex}) and the exponential (eq.~\ref{defex
 manipulate lower absolute values and the roots for large polynomial's degrees can be looked for successfully~\cite{Karimall98}.
 
 Applying this solution for the Ehrlich-Aberth method we obtain the
-iteration function with logarithm:
+iteration function with exponential and logarithm:
 %%$$ \exp \bigl(  \ln(p(z)_{k})-ln(\ln(p(z)_{k}^{'}))- \ln(1- \exp(\ln(p(z)_{k})-ln(\ln(p(z)_{k}^{'})+\ln\sum_{i\neq j}^{n}\frac{1}{z_{k}-z_{j}})$$
 \begin{equation}
 \label{Log_H2}
@@ -481,20 +484,20 @@ provides two read-only memory spaces, the constant space and the
 texture space, which reside in external DRAM, and are accessed via
 read-only caches.
 
-\section{ The implementation of Aberth method on GPU}
+\section{ The implementation of Ehrlich-Aberth method on GPU}
 \label{sec5}
 %%\subsection{A CUDA implementation of the Aberth's method }
 %%\subsection{A GPU implementation of the Aberth's method }
 
 
 
-\subsection{A sequential Aberth algorithm}
-The main steps of Aberth method are shown in Algorithm.~\ref{alg1-seq} :
+\subsection{A sequential Ehrlich-Aberth algorithm}
+The main steps of Ehrlich-Aberth method are shown in Algorithm.~\ref{alg1-seq} :
   
 \begin{algorithm}[H]
 \label{alg1-seq}
 %\LinesNumbered
-\caption{A sequential algorithm to find roots with the Aberth method}
+\caption{A sequential algorithm to find roots with the Ehrlich-Aberth method}
 
 \KwIn{$Z^{0}$(Initial root's vector),$\varepsilon$ (error tolerance threshold),P(Polynomial to solve)}
 \KwOut {Z(The solution root's vector)}
@@ -545,12 +548,12 @@ In the GPU, the schduler assigns the execution of this loop to a group of thread
 
 In CUDA programming, all the instructions of the  \verb=for= loop are executed by the GPU as a kernel. A kernel is a function written in CUDA and defined by the  \verb=__global__= qualifier added before a usual \verb=C= function, which instructs the compiler to generate appropriate code to pass it to the CUDA runtime in order to be executed on the GPU. 
 
-Algorithm~\ref{alg2-cuda} shows a sketch of the Aberth algorithm usind CUDA.
+Algorithm~\ref{alg2-cuda} shows a sketch of the Ehrlich-Aberth algorithm using CUDA.
 
 \begin{algorithm}[H]
 \label{alg2-cuda}
 %\LinesNumbered
-\caption{CUDA Algorithm to find roots with the Aberth method}
+\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)}
@@ -678,7 +681,7 @@ In this experiment we report the performance of log.exp solution describe in ~\r
 \label{fig:01}
 \end{figure}
 
-The figure 3, show a comparison between the execution time of the Ehrlich-Aberth algorithm applying log-exp solution and the execution time of the Ehrlich-Aberth algorithm without applying log-exp 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 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.
 
 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 . 
 
