ajout du code du kernel

diff --git a/code.c b/code.c
new file mode 100644 (file)
index 0000000..d681fa0
--- /dev/null
+++ b/code.c
@@ -0,0 +1,96 @@
+
+
+
+
+//Normal version of the Ehrlich-Aberth method
+cuDoubleComplex FirstH_EA(int i, cuDoubleComplex *Z) {
+  
+  cuDoubleComplex  result;
+  cuDoubleComplex  C,F,Fp;
+  int              j;
+  cuDoubleComplex  sum;
+  cuDoubleComplex  un;
+
+  //evaluate the polynomial
+  F = Fonction(Z[i]);
+  //evaluate the derivative of the poly.
+  Fp=FonctionD(Z[i]);  
+  
+  double mod=Cmodule(F);
+  sum.x=0;sum.y=0;
+  un.x=1;un.y=0;
+  C=Cdiv(F,Fp);       //P(z)/P'(z)
+
+  //for all roots, compute the sum
+  //for the Ehrlich-Aberth iteration 
+  for ( j=0 ; j<P.PolyDegre ; j++ )
+  {
+    if ( i != j )
+    {
+      sum=Cadd(sum,Cdiv(un,Csub(Z[i],Z[j])));
+    }
+  }
+  sum=Cdiv(C,Csub(un,Cmul(C,sum)));   //C/(1-Csum) 
+  result=Csub(Z[i], sum);
+  return (result);
+}
+
+
+//Log Exp version of the Ehrlich-Aberth method
+cuDoubleComplex NewH_EA(int i, cuDoubleComplex *Z) {
+
+  cuDoubleComplex result;
+  cuDoubleComplex F,Fp;
+  cuDoubleComplex one,denominator,sum;
+  int            j;
+  one.x=1;one.y=0;
+  sum.x=0;
+  sum.y=0;
+
+  //evaluate the polynomial with
+  //the LogExp version
+  Fp = LogFonctionD(Z[i]);
+  //evaluate the derivative of the polynomial
+  //with the LogExp version
+  F = LogFonction(Z[i]); 
+  
+  cuDoubleComplex FdivFp=Csub(F,Fp);
+
+  //for all roots, compute the sum
+  //for the Ehrlich-Aberth iteration 
+  for ( j=0 ; j<P.degrePolynome ; j++ )
+  {
+    if ( i != j )
+    {
+      sum=Cadd(sum,Cdiv(un,Csub(Z[i],Z[j])));
+    }
+  }
+
+  //then terminate the computation
+  //of the Ehrlich-Aberth method
+  denominator=Cln(Csub(un,Cexp(Cadd(FdivFp,Cln(sum)))));
+  result=Csub(FdivFp,denominator);
+  result=Csub(Z[i],Cexp(res));
+  
+  return   result;
+  
+}
+
+
+//kernels to update a root i
+cuDoubleComplex H_EA(int i, cuDoubleComplex *Z) {
+  cuDoubleComplex c;
+  //if the root needs to be updated
+  if(!finished[i]) {
+    //according to the module of the root
+    if (Cmodule(Z[i])<=maxRadius)
+      //selects the normal version
+      c = FirstH_EA(i,Z);  
+    else
+      //of the Log Exp version
+      c = NewH_EA(i,Z);
+    return c;
+  }
+  else return Z[i];
+}
+

diff --git a/maj.tex b/maj.tex
index b7abf8665031829fa492c86c93af674b7def17a2..49a7448bd1e5b1edeebe085005c3c29ed399f9d8 100644 (file)
--- a/maj.tex
+++ b/maj.tex
@@ -9,7 +9,8 @@
 \usepackage[textsize=footnotesize]{todonotes}
 \usepackage{amsmath}
 \usepackage{amssymb}
 \usepackage[textsize=footnotesize]{todonotes}
 \usepackage{amsmath}
 \usepackage{amssymb}

-\usepackage{float} 
+\usepackage{float}
+\usepackage{listings}

 \newcommand{\LZK}[2][inline]{%
   \todo[color=red!10,#1]{\sffamily\textbf{LZK:} #2}\xspace}
 \newcommand{\RC}[2][inline]{%
 \newcommand{\LZK}[2][inline]{%
   \todo[color=red!10,#1]{\sffamily\textbf{LZK:} #2}\xspace}
 \newcommand{\RC}[2][inline]{%


@@ -326,7 +327,14 @@ Copy $P$, $P'$ and $Z$ from CPU to GPU\;
 Copy $Z$ from GPU to CPU\;
 \end{algorithm}
 
 Copy $Z$ from GPU to CPU\;
 \end{algorithm}
 

-%\RC{A revoir (c'est de la blague en l'état) : Figure~\ref{fig:00} shows the second kernel code}
+Listing~\ref{lst:01} shows the second kernel code. As can be seen this
+kernel calls multiple kernels, all the operations on complex numbers
+are not detailed.
+
+\begin{footnotesize}
+\lstinputlisting[label=lst:01,caption=Kernels to update the roots]{code.c}
+\end{footnotesize}
+

 %\begin{figure}[htbp]
 %\centering
 %\includegraphics[angle=+0,width=0.4\textwidth]{code}
 %\begin{figure}[htbp]
 %\centering
 %\includegraphics[angle=+0,width=0.4\textwidth]{code}