1 @article{Dirac1953888,
\r
2 title = "The lorentz transformation and absolute time",
\r
3 journal = "Physica ",
\r
8 doi = "10.1016/S0031-8914(53)80099-6",
\r
9 author = "P.A.M. Dirac"
\r
12 @article{Feynman1963118,
\r
13 title = "The theory of a general quantum system interacting with a linear dissipative system",
\r
14 journal = "Annals of Physics ",
\r
18 doi = "10.1016/0003-4916(63)90068-X",
\r
19 author = "R.P Feynman AND F.L {Vernon Jr.}"
\r
23 title = "Iteration Methods for Finding all Zeros of a Polynomial Simultaneously",
\r
24 journal = "Mathematics of Computation",
\r
29 doi = "10.1016/0003-4916(63)90068-X",
\r
30 author = "O. Aberth",
\r
36 title = "On the approximations of Newton",
\r
37 journal = "Annual Sofia Univ",
\r
42 doi = "10.1016/0003-4916(63)90068-X",
\r
43 author = "L. Ilieff",
\r
47 title = "An alternative method of Newton for simultaneous calculation of all the roots of a given algebraic equation",
\r
48 journal = "Phys. Math. J",
\r
53 author = "K. Docev",
\r
57 title = "Solution Numerique des Equations Algebriques, Vol. 1, Equations du Type F(x)=0, Racines d'une Polynome",
\r
63 author = "E. Durand",
\r
67 title = "Ein Gesamtschritteverfahren zur Berechnung der Nullstellen von Polynomen",
\r
73 author = "I. Kerner",
\r
76 @Article{Borch-Supan63,
\r
77 title = "A posteriori error for the zeros of polynomials",
\r
83 author = "W. Borch-Supan",
\r
87 title = "A modified Newton method for polynomials",
\r
88 journal = " Comm. Ass. Comput. Mach.",
\r
93 author = "L.W. Ehrlich",
\r
97 title = "Higher-order iteration functions for simultaneously approximating polynomial zeros",
\r
98 journal = " Intern. J. Computer Math",
\r
103 author = "G. Loizon",
\r
106 @Article{Freeman89,
\r
107 title = " Calculating polynomial zeros on a local memory parallel computer",
\r
108 journal = " Parallel Computing",
\r
113 author = "T.L. Freeman",
\r
116 @Article{Freemanall90,
\r
117 title = " Asynchronous polynomial zero-finding algorithms",
\r
118 journal = " Parallel Computing",
\r
123 author = "T.L. Freeman AND R.K. Brankin",
\r
126 @Article{Raphaelall01,
\r
127 title = " Extraction de racines dans des polynômes creux de degrées élevés.RSRCP (Réseaux et Systèmes Répartis, Calculateurs Parallèles)",
\r
128 journal = " Algorithmes itératifs paralléles et distribués",
\r
133 author = "R. Couturier AND F. Spetiri",
\r
136 @Article{Ostrowski41,
\r
137 title = " On a Theorem by J.L. Walsh Concerning the Moduli of Roots of Algebraic Equations,Bull. A.M.S.",
\r
138 journal = " Algorithmes itératifs paralléles et distribués",
\r
143 author = "A. Ostrowski",
\r
148 title = {Compute Unified Device Architecture Programming Guide Version 3.0},
\r
149 OPTkey = {NVIDIA CUDA},
\r
151 OPTorganization = {NVIDIA CUDA},
\r
154 OPTmonth = {March},
\r
156 OPTnote = {http://www.nvidia.com/object/cuda_develop.html},
\r
160 @Article{Kahinall14,
\r
161 title = " parallel implementation of the Durand-Kerner algorithm for polynomial root-finding on GPU",
\r
162 journal = " IEEE. Conf. on advanced Networking, Distributed Systems and Applications",
\r
167 author = "K. Ghidouche AND R. Couturie AND A. Sider",
\r
170 @Article{Karimall98,
\r
172 title = " Perfectionnements de la méthode asynchrone de Durand-Kerner pour les polynômes complexes",
\r
173 journal = " Calculateurs Parallèles",
\r
178 author = "K. Rhofir AND F. Spies AND Jean-Claude Miellou",
\r
183 title = " Numerical computation of polynomial zeros by means of Aberth s method",
\r
184 journal = " Numerical Algorithms",
\r
189 author = "D. Bini",
\r
192 @Article{Mirankar68,
\r
193 title = " Parallel methods for approximating the roots of a function",
\r
194 journal = " IBM Res Dev",
\r
199 author = "WL. Mirankar",
\r
202 @Article{Mirankar71,
\r
203 title = " A survey of parallelism in numerical analysis",
\r
204 journal = " SIAM Rev",
\r
209 author = "WL. Mirankar",
\r
212 @Article{Schedler72,
\r
213 title = " Parallel iteration methods in complexity of computer communications",
\r
214 journal = " Commun ACM ",
\r
219 author = "GS. Schedler",
\r
222 @Article{Winogard72,
\r
223 title = " Parallel iteration methods in complexity of computer communications",
\r
224 journal = " Plenum, New York",
\r
229 author = "S. Winogard",
\r
233 title = " A fast parallel algorithm for determining all roots of a polynomial with real roots",
\r
234 journal = " Int: Proc of ACM",
\r
239 author = "M. Ben-Or AND E. Feig AND D. Kozzen AND P. Tiwary",
\r
242 @Article{Riceall06,
\r
243 title = " A highly parallel algorithm for root extraction",
\r
244 journal = " IEEE Trans Comp",
\r
249 author = "TA. Rice AND LH. Jamieson",
\r
252 @Article{Cosnard90,
\r
253 title = " Finding the roots of a polynomial on an MIMD multicomputer",
\r
254 journal = " Parallel Comput",
\r
259 author = "M. Cosnard AND P. Fraigniaud",
\r
263 title = " Efficient parallel algorithms for finding polynomial zeroes",
\r
264 journal = "Proc of the 6th int conference on advance computing, CDAC, Pune University Campus,India",
\r
269 author = "PK. Jana AND BP. Sinha AND R. Datta Gupta",
\r
273 title = " Polynomial interpolation and polynomial root finding on OTIS-Mesh",
\r
274 journal = " Parallel Comput",
\r
279 author = "PK. Jana",
\r
281 @Article{Kalantari08,
\r
282 title = " Polynomial root finding and polynomiography.",
\r
283 journal = " World Scientifict,New Jersey",
\r
288 author = "B. Kalantari",
\r
291 @Article{Gemignani07,
\r
292 title = " Structured matrix methods for polynomial root finding.",
\r
293 journal = " n: Proc of the 2007 Intl symposium on symbolic and algebraic computation",
\r
298 author = "L. Gemignani",
\r
303 @Article{Skachek08,
\r
304 title = " Structured matrix methods for polynomial root finding.",
\r
305 journal = " n: Proc of the 2007 Intl symposium on symbolic and algebraic computation",
\r
310 author = "V. Skachek",
\r
314 AUTHOR = {V. Skachek},
\r
316 TITLE = {Probabilistic algorithm for finding roots of linearized polynomials},
\r
317 PUBLISHER = {codes and cryptography. Kluwer},
\r
323 edition = {Design},
\r
333 @Article{Zhancall08,
\r
334 title = " A constrained learning algorithm for finding multiple real roots of polynomial",
\r
335 journal = " In: Proc of the 2008 intl symposium on computational intelligence and design",
\r
340 author = "X. Zhanc AND M. Wan,Z.Yi",
\r
345 title = " an adaptive algorithm finding multiple roots of polynomials",
\r
346 journal = " Lect Notes Comput Sci ",
\r
351 author = "W. Zhu AND w. Zeng AND D. Lin",
\r
354 title = " The performance of synchronous parallel polynomial root extraction on a ring multicomputer",
\r
355 journal = " Clust Comput ",
\r
360 author = "HS. Azad",
\r
367 title = " Inverse power and Durand Kerner iterations for univariate polynomial root finding",
\r
368 journal = " Comput Math Appl ",
\r
373 author = "DA. Bini AND L. Gemignani",
\r
377 title = " Finding polynomial zeroes on a Multi-mesh of trees (MMT)",
\r
378 journal = " In: Proc of the 2nd int conference on information technology",
\r
383 author = "PK. Jana",
\r
386 @Article{Weierstrass03,
\r
387 title = " Neuer Beweis des Satzes, dass jede ganze rationale function einer veranderlichen dagestellt werden kann als ein product aus linearen functionen derselben veranderlichen",
\r
388 journal = " Ges. Werke",
\r
393 author = "K. Weierstrass",
\r
400 editor = {Design Guide},
\r
401 TITLE = {NVIDIA CUDA C Programming Guide},
\r