-@article{Dirac1953888,
- title = "The lorentz transformation and absolute time",
- journal = "Physica ",
- volume = "19",
- number = "1-–12",
- pages = "888--896",
- year = "1953",
- doi = "10.1016/S0031-8914(53)80099-6",
- author = "P.A.M. Dirac"
-}
+@InCollection{newt1670,
+ author = "Isaac Newton",
+ year = "1670--71?",
+ title = "Tractatus de Methodis Serierum et Fluxionum",
+ booktitle = "The Mathematical Papers of Isaac Newton, III",
+ editor = "D. T. Whiteside",
+ pages = "32--353",
+ publisher = "Cambridge University Press, Cambridge",
+ kwds = "na, history, Newton's method",
+}x
+
+@Book{Cardano15,
+ author = "Girolamo Cardano",
+ title = "Ars Magna or The Rules of Algebra, 1545",
+ editor = "T. Richard Witmer",
+ publisher = "MIT",
+ year = "1968",
+}x
+
+@Article{NH-Abel26,
+ title = "Beweis der Unmöglichkeit, algebraische Gleichungen von höheren Graden als dem vierten allgemein aufzulösen",
+ journal = "J. reine angew, Math",
+ volume = "1",
+ number = "1",
+ pages = "65--84",
+ year = "1826",
+ author = "Niels Henrik Abel",
+
+}x
-@article{Feynman1963118,
- title = "The theory of a general quantum system interacting with a linear dissipative system",
- journal = "Annals of Physics ",
- volume = "24",
- pages = "118--173",
- year = "1963",
- doi = "10.1016/0003-4916(63)90068-X",
- author = "R.P Feynman AND F.L {Vernon Jr.}"
-}
@Article{Aberth73,
title = "Iteration Methods for Finding all Zeros of a Polynomial Simultaneously",
number = "122",
pages = "339--344",
year = "1973",
- doi = "10.1016/0003-4916(63)90068-X",
author = "O. Aberth",
}x
number = "",
pages = "167--171",
year = "1950",
- doi = "10.1016/0003-4916(63)90068-X",
- author = "L. Ilieff",
+ author = "L. Ilieff",
}x
title = "Higher-order iteration functions for simultaneously approximating polynomial zeros",
journal = " Intern. J. Computer Math",
volume = "14",
- number = "",
+ number = "1",
pages = "45-58",
year = "1983",
author = "G. Loizou",
}x
@Article{Freeman89,
- title = " Calculating polynomial zeros on a local memory parallel computer",
- journal = " Parallel Computing",
- volume = "12",
- number = "",
- pages = "351-358",
- year = "1989",
- author = "T.L. Freeman",
-}x
-
+ title = "Calculating polynomial zeros on a local memory
+ parallel computer",
+ author = "T. L. Freeman",
+ journal = "Parallel Computing",
+ year = "1989",
+ number = "3",
+ volume = "12",
+ bibdate = "2011-09-09",
+ bibsource = "DBLP,
+ http://dblp.uni-trier.de/db/journals/pc/pc12.html#Freeman89",
+ pages = "351--358",
+ URL = "http://dx.doi.org/10.1016/0167-8191(89)90093-8",
+}
@Article{Freemanall90,
title = " Asynchronous polynomial zero-finding algorithms",
journal = " Parallel Computing",
}x
@Article{Raphaelall01,
- 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)",
+ 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)",
journal = " Algorithmes itératifs paralléles et distribués",
volume = "1",
number = "13",
}x
@Article{Ostrowski41,
- title = " On a Theorem by J.L. Walsh Concerning the Moduli of Roots of Algebraic Equations,Bull. A.M.S.",
+ title = " On a Theorem by {J. L. Walsh} Concerning the Moduli of Roots of Algebraic Equations. A.M.S.",
journal = " Algorithmes itératifs paralléles et distribués",
volume = "1",
number = "47",
}
@Article{Kahinall14,
- title = " parallel implementation of the Durand-Kerner algorithm for polynomial root-finding on GPU",
- journal = " IEEE. Conf. on advanced Networking, Distributed Systems and Applications",
+ title = "Parallel implementation of the {D}urand-{K}erner algorithm for polynomial root-finding on {GPU}",
+ journal = "IEEE. Conf. on advanced Networking, Distributed Systems and Applications",
volume = "",
number = "",
pages = "53-57",
@Article{Karimall98,
- title = " Perfectionnements de la méthode asynchrone de Durand-Kerner pour les polynômes complexes",
+ title = " Perfectionnements de la méthode asynchrone de {D}urand-{K}erner pour les polynômes complexes",
journal = " Calculateurs Parallèles",
volume = "10",
number = "4",
}x
@Article{Bini96,
-
- title = " Numerical computation of polynomial zeros by means of Aberth s method",
- journal = " Numerical Algorithms",
- volume = "13",
- number = "4",
- pages = "179-200",
- year = "1996",
- author = "D. Bini",
-}x
-
+ title = "Numerical computation of polynomial zeros by means of
+ Aberth's method",
+ author = "D. Bini",
+ journal = "Numerical Algorithms",
+ year = "1996",
+ number = "2",
+ volume = "13",
+ bibdate = "2015-09-27",
+ bibsource = "DBLP,
+ http://dblp.uni-trier.de/db/journals/na/na13.html#Bini96",
+ pages = "179--200",
+ URL = "http://dx.doi.org/10.1007/BF02207694",
+}
@Article{Mirankar68,
title = " Parallel methods for approximating the roots of a function",
journal = " IBM Res Dev",
- volume = "30",
+ volume = "13",
number = "",
pages = "297-301",
year = "1968",
@Article{Mirankar71,
title = " A survey of parallelism in numerical analysis",
journal = " SIAM Rev",
- volume = "",
+ volume = "13",
number = "",
pages = "524-547",
year = "1971",
}x
@Article{Schedler72,
- title = " Parallel iteration methods in complexity of computer communications",
+ title = " Parallel Numerical Methods for Solution of Equations",
journal = " Commun ACM ",
- volume = "",
+ volume = "10",
number = "",
pages = "286-290",
year = "1967",
author = "GS. Schedler",
}x
-@Article{Winogard72,
- title = " Parallel iteration methods in complexity of computer communications",
- journal = " Plenum, New York",
- volume = "",
- number = "",
- pages = "",
- year = "1972",
- author = "S. Winogard",
+@InProceedings{Winogard72,
+ title = "Parallel Iteration Methods",
+ author = "S. Winograd",
+ bibdate = "2011-09-13",
+ bibsource = "DBLP,
+ http://dblp.uni-trier.de/db/conf/coco/cocc1972.html#Winograd72",
+ booktitle = "Complexity of Computer Computations",
+ publisher = "Plenum Press, New York",
+ year = "1972",
+ editor = "Raymond E. Miller and James W. Thatcher",
+ ISBN = "0-306-30707-3",
+ pages = "53--60",
+ series = "The IBM Research Symposia Series",
}x
@Article{Benall68,
volume = "",
number = "",
pages = "340-349",
- year = "1968",
+ year = "1988",
author = "M. Ben-Or AND E. Feig AND D. Kozzen AND P. Tiwary",
}x
}x
+
@InProceedings{Gemignani07,
- author = "Luca Gemignani",
+ author = "L. Gemignani",
title = "Structured matrix methods for polynomial
root-finding",
editor = "C. W. Brown",
@Article{Skachek008,
title = "Probabilistic algorithm for finding roots of
linearized polynomials",
- author = "Vitaly Skachek and Ron M. Roth",
+ author = "V. Skachek AND M. Roth",
journal = "Des. Codes Cryptography",
year = "2008",
number = "1",
@InProceedings{Zhuall08,
title = "An Adaptive Algorithm Finding Multiple Roots of Polynomials",
- author = "Wei Zhu and Zhe-zhao Zeng and Dong-mei Lin",
+ author = "W. Zhu AND Z. Zeng AND Dm. Lin",
bibdate = "2008-09-25",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/conf/isnn/isnn2008-2.html#ZhuZL08",