\begin{frontmatter}
- \title{Parallel polynomial root finding using GPU}
+ \title{Rapid solution of very high degree polynomials root finding using GPU}
%% Group authors per affiliation:
\author{Elsevier\fnref{myfootnote}}
\address[mysecondaryaddress]{FEMTO-ST Institute, University of Franche-Compté }
\begin{abstract}
- in this article we present a parallel implementation
- of the Aberth algorithm for the problem root finding for
- high degree polynomials on GPU architecture (Graphics
- Processing Unit).
+ Polynomials are mathematical algebraic structures that play a great role in science and engineering. But the process of solving them for high and large degrees is computationally demanding and still not solved. In this paper, we present the results of a parallel implementation of the Ehrlish-Aberth algorithm for the problem root finding for
+ high degree polynomials on GPU architectures (Graphics Processing Unit). The main result of this work is to be able to solve high and very large degree polynomials (up to 100000) very efficiently. We also compare the results with a sequential implementation and the Durand-Kerner method on full and sparse polynomials.
\end{abstract}
\begin{keyword}
- root finding of polynomials, high degree, iterative methods, Durant-Kerner, GPU, CUDA, CPU , Parallelization
+ root finding of polynomials, high degree, iterative methods, Ehrlish-Aberth, Durant-Kerner, GPU, CUDA, CPU , Parallelization
\end{keyword}
\end{frontmatter}
\linenumbers
\section{The problem of finding roots of a polynomial}
- Polynomials are algebraic structures used in mathematics that capture physical phenomenons and that express the outcome in the form of a function of some unknown variable. Formally speaking, a polynomial $p(x)$ of degree \textit{n} having $n$ coefficients in the complex plane \textit{C} and zeros $\alpha_{i},\textit{i=1,...,n}$
+ Polynomials are mathematical algebraic structures used in science and engineering to capture physical phenomenons and to express any outcome in the form of a function of some unknown variables. Formally speaking, a polynomial $p(x)$ of degree \textit{n} having $n$ coefficients in the complex plane \textit{C} is :
%%\begin{center}
\begin{equation}
- {\Large p(x)=\sum_{i=0}^{n}{a_{i}x^{i}}=a_{n}\prod_{i=1}^{n}(x-\alpha_{i}), a_{0} a_{n}\neq 0}.
+ {\Large p(x)=\sum_{i=0}^{n}{a_{i}x^{i}}}.
\end{equation}
%%\end{center}
- The root finding problem consists in finding the values of all the $n$ values of the variable $x$ for which \textit{p(x)} is nullified. Such values are called zeroes of $p$. The problem of finding a root is equivalent to that of solving a fixed-point problem. To see this, consider the fixed-point problem of finding the $n$-dimensional
+ The root finding problem consists in finding the values of all the $n$ values of the variable $x$ for which \textit{p(x)} is nullified. Such values are called zeroes of $p$. If zeros are $\alpha_{i},\textit{i=1,...,n}$ the $p(x)$ can be written as :
+ \begin{equation}
+ {\Large p(x)=a_{n}\prod_{i=1}^{n}(x-\alpha_{i}), a_{0} a_{n}\neq 0}.
+ \end{equation}
+
+ The problem of finding a root is equivalent to that of solving a fixed-point problem. To see this, consider the fixed-point problem of finding the $n$-dimensional
vector $x$ such that
\begin{center}
$x=g(x)$
\sum_{k\neq j}^{n}\frac{1}{z_{k}-z_{j}}\right)\right).
\end{equation}
-This solution is applied when it is necessary ??? When ??? (SIDER)
+This solution is applied when the root except the circle unit, represented by the radius $R$ evaluated as:
+
+$$R = \exp( \log(DBL\_MAX) / (2*n) )$$ where $DBL\_MAX$ stands for the maximum representable double value.
\section{The implementation of simultaneous methods in a parallel computer}
\label{secStateofArt}
Moreover, they have fast rate of convergence (quadratic for the
Durand-Kerner and cubic for the Ehrlisch-Aberth). Various parallel
algorithms reported for these methods can be found
-in~\cite{Cosnard90, Freeman89,Freemanall90,,Jana99,Janall99}.
+in~\cite{Cosnard90, Freeman89,Freemanall90,Jana99,Janall99}.
Freeman and Bane~\cite{Freemanall90} presented two parallel
algorithms on a local memory MIMD computer with the compute-to
communication time ratio O(n). However, their algorithms require
\section {A CUDA parallel Ehrlisch-Aberth method}
+In the following, we describe the parallel implementation of Ehrlisch-Aberth method on GPU
+for solving high degree polynomials. First, the hardware and software of the GPUs are presented. Then, a CUDA parallel Ehrlisch-Aberth method are presented.
\subsection{Background on the GPU architecture}
A GPU is viewed as an accelerator for the data-parallel and
