X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper1.git/blobdiff_plain/17c6b8d0b68892da7bd60cdf9c25aeb1e1baec7b..678af17d555f0b97bc6d9282988794e600cafcc7:/mybibfile.bib diff --git a/mybibfile.bib b/mybibfile.bib index 37e3d42..47cab48 100644 --- a/mybibfile.bib +++ b/mybibfile.bib @@ -1,24 +1,3 @@ -@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" -} - -@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", journal = "Mathematics of Computation", @@ -26,7 +5,6 @@ number = "122", pages = "339--344", year = "1973", - doi = "10.1016/0003-4916(63)90068-X", author = "O. Aberth", }x @@ -38,8 +16,7 @@ number = "", pages = "167--171", year = "1950", - doi = "10.1016/0003-4916(63)90068-X", - author = "L. Ilieff", + author = "L. Ilieff", }x @@ -130,15 +107,19 @@ }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", @@ -205,20 +186,23 @@ OPTannote = {•} }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", @@ -228,7 +212,7 @@ OPTannote = {•} @Article{Mirankar71, title = " A survey of parallelism in numerical analysis", journal = " SIAM Rev", - volume = "", + volume = "13", number = "", pages = "524-547", year = "1971", @@ -236,9 +220,9 @@ OPTannote = {•} }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", @@ -246,11 +230,11 @@ OPTannote = {•} }x @Article{Winogard72, - title = " Parallel iteration methods in complexity of computer communications", + title = " Parallel iteration methods", journal = " Plenum, New York", volume = "", number = "", - pages = "", + pages = "53-60", year = "1972", author = "S. Winogard", }x @@ -261,7 +245,7 @@ OPTannote = {•} volume = "", number = "", pages = "340-349", - year = "1968", + year = "1988", author = "M. Ben-Or AND E. Feig AND D. Kozzen AND P. Tiwary", }x @@ -332,6 +316,7 @@ Article{Skachek08, }x + @InProceedings{Gemignani07, author = "Luca Gemignani", title = "Structured matrix methods for polynomial