From: couturie <couturie@extinction>
Date: Wed, 28 Oct 2015 02:08:18 +0000 (-0400)
Subject: debut correct
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper1.git/commitdiff_plain/1c032eb8576d3d2ae1b6f4a297c7437af7c26c02?ds=inline;hp=-c

debut correct
---

1c032eb8576d3d2ae1b6f4a297c7437af7c26c02
diff --git a/paper.tex b/paper.tex
index fa4f62a..9e84151 100644
--- a/paper.tex
+++ b/paper.tex
@@ -1,7 +1,7 @@
 \documentclass[review]{elsarticle}
 
 \usepackage{lineno,hyperref}
-%%\usepackage[utf8]{inputenc}
+\usepackage[utf8]{inputenc}
 %%\usepackage[T1]{fontenc}
 %%\usepackage[french]{babel}
 \usepackage{float} 
@@ -54,37 +54,47 @@
 
 \begin{frontmatter}
 
-\title{Rapid solution of very high degree polynomials root finding using GPU}
+\title{Efficient high degree polynomial root finding using GPU}
 
 %% Group authors per affiliation:
-\author{Elsevier\fnref{myfootnote}}
-\address{Radarweg 29, Amsterdam}
-\fntext[myfootnote]{Since 1880.}
+%\author{Elsevier\fnref{myfootnote}}
+%\address{Radarweg 29, Amsterdam}
+%\fntext[myfootnote]{Since 1880.}
 
 %% or include affiliations in footnotes:
-\author[mymainaddress]{Ghidouche Kahina\corref{mycorrespondingauthor}}
+\author[mymainaddress]{Kahina Ghidouche}
 %%\ead[url]{kahina.ghidouche@univ-bejaia.dz}
 \cortext[mycorrespondingauthor]{Corresponding author}
 \ead{kahina.ghidouche@univ-bejaia.dz}
 
-\author[mysecondaryaddress]{Couturier Raphael\corref{mycorrespondingauthor}}
+\author[mysecondaryaddress]{Raphaël Couturier\corref{mycorrespondingauthor}}
 %%\cortext[mycorrespondingauthor]{Corresponding author}
 \ead{raphael.couturier@univ-fcomte.fr}
 
-\author[mymainaddress]{Abderrahmane Sider\corref{mycorrespondingauthor}}
+\author[mymainaddress]{Abderrahmane Sider}
 %%\cortext[mycorrespondingauthor]{Corresponding author}
 \ead{ar.sider@univ-bejaia.dz}
 
-\address[mymainaddress]{Laboratoire LIMED,Faculté des sciences exactes,Université de Bejaia,06000,Algeria}
-\address[mysecondaryaddress]{FEMTO-ST Institute,Université de Franche-Compté }
+\address[mymainaddress]{Laboratoire LIMED, Faculté des sciences
+  exactes, Université de Bejaia, 06000, Algeria}
+\address[mysecondaryaddress]{FEMTO-ST Institute, University of
+  Bourgogne Franche-Comte, France }
 
 \begin{abstract}
-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 Ehrlich-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.
+Polynomials are mathematical algebraic structures that play a great
+role in science and engineering. Finding roots of high degree
+polynomials is computationally demanding. In this paper, we present
+the results of a parallel implementation of the Ehrlich-Aberth
+algorithm for the root finding problem for high degree polynomials on
+GPU architectures. The main result of this
+work is to be able to solve high degree polynomials (up
+to 1,000,000) 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, Ehrlich-Aberth, Durant-Kerner, GPU, CUDA, CPU , Parallelization
+Polynomial root finding, Iterative methods, Ehrlich-Aberth, Durand-Kerner, GPU
 \end{keyword}
 
 \end{frontmatter}
@@ -124,17 +134,17 @@ Generally speaking, algorithms for solving problems can be divided into
 two main groups: direct methods and iterative methods.
 \\
 Direct methods exist only for $n \leq 4$, solved in closed form by G. Cardano
-in the mid-16th century. However, N.H. Abel in the early 19th
+in the mid-16th century. However, N. H. Abel in the early 19th
 century showed that polynomials of degree five or more could not
-be solved by  directs methods. Since then, mathmathicians have
+be solved by  direct methods. Since then, mathmathicians have
 focussed on numerical (iterative) methods such as the famous
-Newton's method, Bernoulli's method of the 18th, and Graeffe's.
+Newton method, the Bernoulli method of the 18th, and the Graeffe method.
 
-Later on, with the advent of electronic computers, other methods has
-been developed such as the Jenkins-Traub method, Larkin's method,
-Muller's method, and several methods for simultaneous
+Later on, with the advent of electronic computers, other methods have
+been developed such as the Jenkins-Traub method, the Larkin method,
+the Muller method, and several methods for simultaneous
 approximation of all the roots, starting with the Durand-Kerner (DK)
-method :
+method:
 %%\begin{center}
 \begin{equation}
  Z_{i}=Z_{i}-\frac{P(Z_{i})}{\prod_{i\neq j}(z_{i}-z_{j})}