1 \BOOKMARK [1][-]{section.1}{Root finding problem}{}% 1
\r
2 \BOOKMARK [1][-]{section.2}{Aberth method}{}% 2
\r
3 \BOOKMARK [2][-]{subsection.2.1}{Polynomials Initialization}{section.2}% 3
\r
4 \BOOKMARK [2][-]{subsection.2.2}{Vector Z\(0\) Initialization}{section.2}% 4
\r
5 \BOOKMARK [2][-]{subsection.2.3}{Iterative Function Hi}{section.2}% 5
\r
6 \BOOKMARK [2][-]{subsection.2.4}{Convergence condition}{section.2}% 6
\r
7 \BOOKMARK [1][-]{section.3}{Amelioration of Aberth method }{}% 7
\r
8 \BOOKMARK [1][-]{section.4}{The implementation of simultaneous methods in a parallel computer}{}% 8
\r
9 \BOOKMARK [1][-]{section.5}{A parallel implementation of Aberth method}{}% 9
\r
10 \BOOKMARK [2][-]{subsection.5.1}{Background on the GPU architecture}{section.5}% 10
\r
11 \BOOKMARK [2][-]{subsection.5.2}{Background on the CUDA Programming Model}{section.5}% 11
\r
12 \BOOKMARK [2][-]{subsection.5.3}{ The implementation of Aberth method on GPU}{section.5}% 12
\r
13 \BOOKMARK [3][-]{subsubsection.5.3.1}{A sequential Aberth algorithm}{subsection.5.3}% 13
\r
14 \BOOKMARK [3][-]{subsubsection.5.3.2}{Parallelize the steps on GPU }{subsection.5.3}% 14
\r
15 \BOOKMARK [2][-]{subsection.5.4}{Experimental study}{section.5}% 15
\r
16 \BOOKMARK [3][-]{subsubsection.5.4.1}{Definition of the polynomial used}{subsection.5.4}% 16
\r
17 \BOOKMARK [3][-]{subsubsection.5.4.2}{The study condition}{subsection.5.4}% 17
\r
18 \BOOKMARK [3][-]{subsubsection.5.4.3}{Comparative study}{subsection.5.4}% 18
\r
