+@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{Aberth73,
title = "Iteration Methods for Finding all Zeros of a Polynomial Simultaneously",
journal = "Mathematics of Computation",
}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",
+ 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 = "",
@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",
author = "GS. Schedler",
}x
-@Article{Winogard72,
- title = " Parallel iteration methods",
- journal = " Plenum, New York",
- volume = "",
- number = "",
- pages = "53-60",
- 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,
@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",