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

diff --git a/paper.tex b/paper.tex
index 788db9a..e8ec4e3 100644
--- a/paper.tex
+++ b/paper.tex
@@ -385,7 +385,7 @@ Authors usually adopt one of the two following approaches to parallelize root
 finding algorithms. The first approach aims at reducing the total number of
 iterations as by Miranker
 ~\cite{Mirankar68,Mirankar71}, Schedler~\cite{Schedler72} and
-Winogard~\cite{Winogard72}. The second approach aims at reducing the
+Winograd~\cite{Winogard72}. The second approach aims at reducing the
 computation time per iteration, as reported
 in~\cite{Benall68,Jana06,Janall99,Riceall06}. 
 
@@ -843,7 +843,8 @@ numerical applications on GPU.
 
 In future works, we plan to investigate the possibility of using
 several multiple GPUs simultaneously, either with multi-GPU machine or
-with cluster of GPUs.
+with cluster of GPUs. It may also be interesting to study the
+implementation of other root finding polynomial methods on GPU.
 
 
 
