1 \begin{thebibliography}{10}
\r
2 \expandafter\ifx\csname url\endcsname\relax
\r
3 \def\url#1{\texttt{#1}}\fi
\r
4 \expandafter\ifx\csname urlprefix\endcsname\relax\def\urlprefix{URL }\fi
\r
5 \expandafter\ifx\csname href\endcsname\relax
\r
6 \def\href#1#2{#2} \def\path#1{#1}\fi
\r
8 \bibitem{Weierstrass03}
\r
9 K.~Weierstrass, Neuer beweis des satzes, dass jede ganze rationale function
\r
10 einer veranderlichen dagestellt werden kann als ein product aus linearen
\r
11 functionen derselben veranderlichen, Ges. Werke 3 (1903) 251--269.
\r
14 L.~Ilieff, On the approximations of newton, Annual Sofia Univ~(46) (1950)
\r
16 \newblock \href {http://dx.doi.org/10.1016/0003-4916(63)90068-X}
\r
17 {\path{doi:10.1016/0003-4916(63)90068-X}}.
\r
20 K.~Docev, An alternative method of newton for simultaneous calculation of all
\r
21 the roots of a given algebraic equation, Phys. Math. J~(5) (1962) 136--139.
\r
24 E.~Durand, Solution numerique des equations algebriques, vol. 1, equations du
\r
25 type f(x)=0, racines d'une polynome Vol.1.
\r
28 I.~Kerner, Ein gesamtschritteverfahren zur berechnung der nullstellen von
\r
29 polynomen~(8) (1966) 290--294.
\r
31 \bibitem{Borch-Supan63}
\r
32 W.~Borch-Supan, A posteriori error for the zeros of polynomials~(5) (1963)
\r
36 L.~Ehrlich, A modified newton method for polynomials, Comm. Ass. Comput.
\r
37 Mach.~(10) (1967) 107--108.
\r
40 O.~Aberth, Iteration methods for finding all zeros of a polynomial
\r
41 simultaneously, Mathematics of Computation 27~(122) (1973) 339--344.
\r
42 \newblock \href {http://dx.doi.org/10.1016/0003-4916(63)90068-X}
\r
43 {\path{doi:10.1016/0003-4916(63)90068-X}}.
\r
46 G.~Loizon, Higher-order iteration functions for simultaneously approximating
\r
47 polynomial zeros, Intern. J. Computer Math~(14) (1983) 45--58.
\r
50 T.~Freeman, Calculating polynomial zeros on a local memory parallel computer,
\r
51 Parallel Computing~(12) (1989) 351--358.
\r
53 \bibitem{Freemanall90}
\r
54 T.~Freeman, R.~Brankin, Asynchronous polynomial zero-finding algorithms,
\r
55 Parallel Computing~(17) (1990) 673--681.
\r
57 \bibitem{Raphaelall01}
\r
58 R.~Couturier, F.~Spetiri, Extraction de racines dans des polynômes creux de
\r
59 degrées élevés.rsrcp (réseaux et systèmes répartis, calculateurs
\r
60 parallèles), Algorithmes itératifs paralléles et distribués 1~(13) (1990)
\r
64 Compute Unified Device Architecture Programming Guide Version 3.0.
\r
66 \bibitem{Kahinall14}
\r
67 K.~Ghidouche, R.~Couturie, A.~Sider, parallel implementation of the
\r
68 durand-kerner algorithm for polynomial root-finding on gpu, IEEE. Conf. on
\r
69 advanced Networking, Distributed Systems and Applications (2014) 53--57.
\r
72 D.~Bini, Numerical computation of polynomial zeros by means of aberth s method,
\r
73 Numerical Algorithms 13~(4) (1996) 179--200.
\r
75 \bibitem{Ostrowski41}
\r
76 A.~Ostrowski, On a theorem by j.l. walsh concerning the moduli of roots of
\r
77 algebraic equations,bull. a.m.s., Algorithmes itératifs paralléles et
\r
78 distribués 1~(47) (1941) 742--746.
\r
80 \bibitem{Karimall98}
\r
81 K.~Rhofir, F.~Spies, J.-C. Miellou, Perfectionnements de la méthode asynchrone
\r
82 de durand-kerner pour les polynômes complexes, Calculateurs Parallèles
\r
83 10~(4) (1998) 449--458.
\r
85 \bibitem{Mirankar68}
\r
86 W.~Mirankar, Parallel methods for approximating the roots of a function, IBM
\r
87 Res Dev 30 (1968) 297--301.
\r
89 \bibitem{Mirankar71}
\r
90 W.~Mirankar, A survey of parallelism in numerical analysis, SIAM Rev (1971)
\r
93 \bibitem{Schedler72}
\r
94 G.~Schedler, Parallel iteration methods in complexity of computer
\r
95 communications, Commun ACM (1967) 286--290.
\r
97 \bibitem{Winogard72}
\r
98 S.~Winogard, Parallel iteration methods in complexity of computer
\r
99 communications, Plenum, New York.
\r
102 M.~Ben-Or, E.~Feig, D.~Kozzen, P.~Tiwary, A fast parallel algorithm for
\r
103 determining all roots of a polynomial with real roots, Int: Proc of ACM
\r
107 P.~Jana, Polynomial interpolation and polynomial root finding on otis-mesh,
\r
108 Parallel Comput 32~(3) (2006) 301--312.
\r
111 P.~Jana, B.~Sinha, R.~D. Gupta, Efficient parallel algorithms for finding
\r
112 polynomial zeroes, Proc of the 6th int conference on advance computing, CDAC,
\r
113 Pune University Campus,India 15~(3) (1999) 189--196.
\r
115 \bibitem{Riceall06}
\r
116 T.~Rice, L.~Jamieson, A highly parallel algorithm for root extraction, IEEE
\r
117 Trans Comp 38~(3) (2006) 443--449.
\r
120 H.~Azad, The performance of synchronous parallel polynomial root extraction on
\r
121 a ring multicomputer, Clust Comput 2~(10) (2007) 167--174.
\r
123 \bibitem{Gemignani07}
\r
124 L.~Gemignani, Structured matrix methods for polynomial root finding., n: Proc
\r
125 of the 2007 Intl symposium on symbolic and algebraic computation (2007)
\r
128 \bibitem{Kalantari08}
\r
129 B.~Kalantari, Polynomial root finding and polynomiography., World
\r
130 Scientifict,New Jersey.
\r
132 \bibitem{Skachek08}
\r
133 V.~Skachek, Structured matrix methods for polynomial root finding., n: Proc of
\r
134 the 2007 Intl symposium on symbolic and algebraic computation (2008)
\r
137 \bibitem{Zhancall08}
\r
138 X.~Zhanc, Z.~M.~Wan, A constrained learning algorithm for finding multiple real
\r
139 roots of polynomial, In: Proc of the 2008 intl symposium on computational
\r
140 intelligence and design (2008) 38--41.
\r
143 W.~Zhu, w.~Zeng, D.~Lin, an adaptive algorithm finding multiple roots of
\r
144 polynomials, Lect Notes Comput Sci~(5262) (2008) 674--681.
\r
147 D.~Bini, L.~Gemignani, Inverse power and durand kerner iterations for
\r
148 univariate polynomial root finding, Comput Math Appl~(47) (2004) 447--459.
\r
150 \bibitem{Cosnard90}
\r
151 M.~Cosnard, P.~Fraigniaud, Finding the roots of a polynomial on an mimd
\r
152 multicomputer, Parallel Comput 15~(3) (1990) 75--85.
\r
155 P.~Jana, Finding polynomial zeroes on a multi-mesh of trees (mmt), In: Proc of
\r
156 the 2nd int conference on information technology (1999) 202--206.
\r
159 NVIDIA, NVIDIA CUDA C Programming Guide, Vol.~7 of 001, PG, 2015.
\r
161 \end{thebibliography}
\r
