new

[kahina_paper1.git] / mybibfile.bib

diff --git a/mybibfile.bib b/mybibfile.bib
index cbaa9020754dbc2ef1765c61413161ae5cd989d5..37e3d4288a8f713724a706b134f2ba6d93571e09 100644 (file)
--- a/mybibfile.bib
+++ b/mybibfile.bib
@@ -31,83 +31,109 @@
        
 }x
 
        
 }x
 

-

 @Article{Ilie50,
   title =   "On the approximations of Newton",
   journal = "Annual Sofia Univ",
 @Article{Ilie50,
   title =   "On the approximations of Newton",
   journal = "Annual Sofia Univ",

-  volume =  "",
-  number =  "46",
+  volume =  "46",
+  number =  "",

   pages =   "167--171",
   year =    "1950",
   doi     = "10.1016/0003-4916(63)90068-X",
        author =  "L. Ilieff",
        
 }x
   pages =   "167--171",
   year =    "1950",
   doi     = "10.1016/0003-4916(63)90068-X",
        author =  "L. Ilieff",
        
 }x

+

 @Article{Docev62,
   title =   "An alternative method of Newton for simultaneous calculation of all the roots of a given algebraic equation",
   journal = "Phys. Math. J",
 @Article{Docev62,
   title =   "An alternative method of Newton for simultaneous calculation of all the roots of a given algebraic equation",
   journal = "Phys. Math. J",

-  volume =  "",
-  number =  "5",
+  volume =  "5",
+  number =  "",

   pages =   "136-139",
   year =    "1962",
   author =  "K. Docev",
 }x
 
   pages =   "136-139",
   year =    "1962",
   author =  "K. Docev",
 }x
 

-@Article{Durand60,
-  title =   "Solution Numerique des Equations Algebriques, Vol. 1, Equations du Type F(x)=0, Racines d'une Polynome",
-  journal = "",
-  volume =  "Vol.1",
-  number =  "",
-  pages =   "",
-  year =    "1960",
-  author =  "E. Durand",
+@Book{Durand60,
+  author =     "\'E. Durand",
+  publisher =  "Masson, Paris",
+  title =      "Solutions num\'eriques des \'equations alg\'ebriques.
+                {T}ome {I}: \'{E}quations du type {$F(x)=0$}; racines
+                d'un polyn\^ome",
+  year =       "1960",

 }x
 
 @Article{Kerner66,
 }x
 
 @Article{Kerner66,

-  title =   "Ein Gesamtschritteverfahren zur Berechnung der Nullstellen von Polynomen",
-  journal = " ",
-  volume =  "",
-  number =  "8",
-  pages =   "290-294",
-  year =    "1966",
-  author =  "I. Kerner",
-}x
+  author =     "Immo O. Kerner",
+  title =      "{Ein Gesamtschrittverfahren zur Berechnung der
+                Nullstellen von Polynomen}. ({German}) [{A} Complete
+                Step Method for the Computation of Zeros of
+                Polynomials]",
+  journal =    "Numerische Mathematik",
+  volume =     "8",
+  number =     "3",
+  pages =      "290--294",
+  month =      may,
+  year =       "1966",
+  CODEN =      "NUMMA7",
+  ISSN =       "0029-599X (print), 0945-3245 (electronic)",
+  bibdate =    "Mon Oct 18 01:28:20 MDT 1999",
+  bibsource =  "http://www.math.utah.edu/pub/tex/bib/nummath.bib",
+  acknowledgement = "Nelson H. F. Beebe, University of Utah, Department
+                of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake
+                City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1
+                801 581 4148, e-mail: \path|beebe@math.utah.edu|,
+                \path|beebe@acm.org|, \path|beebe@computer.org|
+                (Internet), URL:
+                \path|http://www.math.utah.edu/~beebe/|",
+  fjournal =   "Numerische Mathematik",
+  journal-url =  "http://link.springer.com/journal/211",
+  language =   "German",
+}

 
 @Article{Borch-Supan63,
 
 @Article{Borch-Supan63,

-  title =   "A posteriori error for the zeros of polynomials",
-  journal = " ",
-  volume =  "",
-  number =  "5",
-  pages =   "380-398",
-  year =    "1963",
-  author =  "W. Borch-Supan",
-}x
+  author =     "W. Boersch-Supan",
+  title =      "A Posteriori Error Bounds for the Zeros of
+                Polynomials",
+  journal =    "Numerische Mathematik",
+  volume =     "5",
+  pages =      "380--398",
+  year =       "1963",
+  CODEN =      "NUMMA7",
+  ISSN =       "0029-599X",
+  bibdate =    "Fri Jan 12 11:37:56 1996",
+  acknowledgement = "Jon Rokne, Department of Computer Science, The
+                University of Calgary, 2500 University Drive N.W.,
+                Calgary, Alberta T2N 1N4, Canada",
+}

 
 @Article{Ehrlich67,
 
 @Article{Ehrlich67,

-  title =   "A modified Newton method for polynomials",
-  journal = " Comm. Ass. Comput. Mach.",
-  volume =  "",
-  number =  "10",
-  pages =   "107-108",
-  year =    "1967",
-  author =  "L.W. Ehrlich",
-}x
-
-@Article{Loizon83,
+  title =      "A modified Newton method for polynomials",
+  author =     "Louis W. Ehrlich",
+  journal =    "Commun. ACM",
+  year =       "1967",
+  number =     "2",
+  volume =     "10",
+  bibdate =    "2003-11-20",
+  bibsource =  "DBLP,
+                http://dblp.uni-trier.de/db/journals/cacm/cacm10.html#Ehrlich67",
+  pages =      "107--108",
+  URL =        "http://doi.acm.org/10.1145/363067.363115",
+}
+@Article{Loizou83,

   title =   "Higher-order iteration functions for simultaneously approximating polynomial zeros",
   journal = " Intern. J. Computer Math",
   title =   "Higher-order iteration functions for simultaneously approximating polynomial zeros",
   journal = " Intern. J. Computer Math",

-  volume =  "",
-  number =  "14",
+  volume =  "14",
+  number =  "1",

   pages =   "45-58",
   year =    "1983",
   pages =   "45-58",
   year =    "1983",

-  author =  "G. Loizon",
+  author =  "G. Loizou",

 }x
 
 @Article{Freeman89,
   title =   " Calculating polynomial zeros on a local memory parallel computer",
   journal = "  Parallel Computing",
 }x
 
 @Article{Freeman89,
   title =   " Calculating polynomial zeros on a local memory parallel computer",
   journal = "  Parallel Computing",

-  volume =  "",
-  number =  "12",
+  volume =  "12",
+  number =  "",

   pages =   "351-358",
   year =    "1989",
   author =  "T.L. Freeman",
   pages =   "351-358",
   year =    "1989",
   author =  "T.L. Freeman",


@@ -116,25 +142,25 @@
 @Article{Freemanall90,
   title =   " Asynchronous polynomial zero-finding algorithms",
   journal = "  Parallel Computing",
 @Article{Freemanall90,
   title =   " Asynchronous polynomial zero-finding algorithms",
   journal = "  Parallel Computing",

-  volume =  "",
-  number =  "17",
+  volume =  "17",
+  number =  "",

   pages =   "673-681",
   year =    "1990",
   author =  "T.L. Freeman AND R.K. Brankin",
 }x
 
 @Article{Raphaelall01,
   pages =   "673-681",
   year =    "1990",
   author =  "T.L. Freeman AND R.K. Brankin",
 }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",
   pages =   "67-81",
   year =    "1990",
   journal = "  Algorithmes itératifs paralléles et distribués",
   volume =  "1",
   number =  "13",
   pages =   "67-81",
   year =    "1990",

-  author =  "R. Couturier AND F. Spiteri",
+  author =  "R. Couturier AND F. Spies",

 }x
 
 @Article{Ostrowski41,
 }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,Bull. A.M.S.",

   journal = "  Algorithmes itératifs paralléles et distribués",
   volume =  "1",
   number =  "47",
   journal = "  Algorithmes itératifs paralléles et distribués",
   volume =  "1",
   number =  "47",


@@ -158,8 +184,8 @@ OPTannote = {•}
 }
 
 @Article{Kahinall14,
 }
 
 @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 Durand-Kerner algorithm for polynomial root-finding on GPU",
+  journal = "IEEE. Conf. on advanced Networking, Distributed Systems and Applications",

   volume =  "",
   number =  "",
   pages =   "53-57",
   volume =  "",
   number =  "",
   pages =   "53-57",


@@ -278,30 +304,25 @@ OPTannote = {•}
   year =    "2006",
   author =  "PK. Jana",
 }x
   year =    "2006",
   author =  "PK. Jana",
 }x

-@Article{Kalantari08,
-  title =   " Polynomial root finding and polynomiography.",
-  journal = " World Scientifict,New Jersey",
-  volume =  "",
-  number =  "",
-  pages =   "",
-  year =    "",
-  author =  "B. Kalantari",
-}x
-
-@Article{Gemignani07,
-  title =   " Structured matrix methods for polynomial root finding.",
-  journal = " n: Proc of the 2007 Intl symposium on symbolic and algebraic computation",
-  volume =  "",
-  number =  "",
-  pages =   "175-180",
-  year =    "2007",
-  author =  "L. Gemignani",
-}x

 
 
 
 

+@Book{Kalantari08,
+author = {B. Kalantari},
+title = {Polynomial root finding and polynomiography},
+publisher = {World Scientifict},
+year = {2008},
+OPTkey = {•},
+OPTvolume = {•},
+OPTnumber = {•},
+OPTseries = {•},
+OPTaddress = {•},
+OPTmonth = {December},
+OPTnote = {•},
+OPTannote = {•}
+}

 
 

-@Article{Skachek08,
-  title =   " Structured matrix methods for polynomial root finding.",
+Article{Skachek08,
+  title =   " Structured matrix methods for polynomial root finding",

   journal = " n: Proc of the 2007 Intl symposium on symbolic and algebraic computation",
   volume =  "",
   number =  "",
   journal = " n: Proc of the 2007 Intl symposium on symbolic and algebraic computation",
   volume =  "",
   number =  "",


@@ -310,25 +331,60 @@ OPTannote = {•}
   author =  "V. Skachek",
 }x
 
   author =  "V. Skachek",
 }x
 

-@BOOK{Skachek008,
-  AUTHOR =       {V. Skachek},
-  editor =       {\7f},
-  TITLE =        {Probabilistic algorithm for finding roots of linearized polynomials},
-  PUBLISHER =    {codes and cryptography. Kluwer},
-  YEAR =         {2008},
-  volume =       {\7f},
-  number =       {\7f},
-  series =       {\7f},
-  address =      {\7f},
-  edition =      {Design},
-  month =        {\7f},
-  note =         {\7f},
-  abstract =     {\7f},
-  isbn =         {\7f},
-  price =        {\7f},
-  keywords =     {\7f},
-  source =       {\7f},
-}x
+
+@InProceedings{Gemignani07,
+  author =     "Luca Gemignani",
+  title =      "Structured matrix methods for polynomial
+                root-finding",
+  editor =     "C. W. Brown",
+  booktitle =  "Proceedings of the 2007 International Symposium on
+                Symbolic and Algebraic Computation, July 29--August 1,
+                2007, University of Waterloo, Waterloo, Ontario,
+                Canada",
+  publisher =  "ACM Press",
+  address =    "pub-ACM:adr",
+  ISBN =       "1-59593-743-9 (print), 1-59593-742-0 (CD-ROM)",
+  isbn-13 =    "978-1-59593-743-8 (print), 978-1-59593-742-1
+                (CD-ROM)",
+  pages =      "175--180",
+  year =       "2007",
+  doi =        "http://doi.acm.org/10.1145/1277548.1277573",
+  bibdate =    "Fri Jun 20 08:46:50 MDT 2008",
+  bibsource =  "http://portal.acm.org/;
+                http://www.math.utah.edu/pub/tex/bib/issac.bib",
+  abstract =   "In this paper we discuss the use of structured matrix
+                methods for the numerical approximation of the zeros of
+                a univariate polynomial. In particular, it is shown
+                that root-finding algorithms based on floating-point
+                eigenvalue computation can benefit from the structure
+                of the matrix problem to reduce their complexity and
+                memory requirements by an order of magnitude.",
+  acknowledgement = "Nelson H. F. Beebe, University of Utah, Department
+                of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake
+                City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1
+                801 581 4148, e-mail: \path|beebe@math.utah.edu|,
+                \path|beebe@acm.org|, \path|beebe@computer.org|
+                (Internet), URL:
+                \path|http://www.math.utah.edu/~beebe/|",
+  keywords =   "complexity; eigenvalue computation; polynomial
+                root-finding; rank-structured matrices",
+  doi-url =    "http://dx.doi.org/10.1145/1277548.1277573",
+}
+
+@Article{Skachek008,
+  title =      "Probabilistic algorithm for finding roots of
+                linearized polynomials",
+  author =     "Vitaly Skachek and Ron M. Roth",
+  journal =    "Des. Codes Cryptography",
+  year =       "2008",
+  number =     "1",
+  volume =     "46",
+  bibdate =    "2008-03-11",
+  bibsource =  "DBLP,
+                http://dblp.uni-trier.de/db/journals/dcc/dcc46.html#SkachekR08",
+  pages =      "17--23",
+  URL =        "http://dx.doi.org/10.1007/s10623-007-9125-y",
+}

 
 @Article{Zhancall08,
   title =   " A constrained learning algorithm for finding multiple real roots of polynomial",
 
 @Article{Zhancall08,
   title =   " A constrained learning algorithm for finding multiple real roots of polynomial",


@@ -341,15 +397,24 @@ OPTannote = {•}
 }x
 
 
 }x
 
 

-@Article{Zhuall08,
-  title =   " an adaptive algorithm finding multiple roots of polynomials",
-  journal = " Lect Notes Comput Sci ",
-  volume =  "",
-  number =  "5262",
-  pages =   "674-681",
-  year =    "2008",
-  author =  "W. Zhu AND w. Zeng AND D. Lin",
-}x
+@InProceedings{Zhuall08,
+  title =      "An Adaptive Algorithm Finding Multiple Roots of Polynomials",
+  author =     "Wei Zhu AND Zhe-zhao Zeng AND Dong-mei Lin",
+  bibdate =    "2008-09-25",
+  bibsource =  "DBLP,
+                http://dblp.uni-trier.de/db/conf/isnn/isnn2008-2.html#ZhuZL08",
+  booktitle =  "ISNN (2)",
+  publisher =  "Springer",
+  year =       "2008",
+  volume =     "5264",
+  editor =     "Fuchun Sun and Jianwei Zhang 0001 and Ying Tan and
+                Jinde Cao and Wen Yu 0001",
+  ISBN =       "978-3-540-87733-2",
+  pages =      "674--681",
+  series =     "Lecture Notes in Computer Science",
+  URL =        "http://dx.doi.org/10.1007/978-3-540-87734-9_77",
+}
+

 @Article{Azad07,
   title =   " The performance of synchronous parallel polynomial root extraction on a ring multicomputer",
   journal = " Clust Comput ",
 @Article{Azad07,
   title =   " The performance of synchronous parallel polynomial root extraction on a ring multicomputer",
   journal = " Clust Comput ",


@@ -366,8 +431,8 @@ OPTannote = {•}
 @Article{Bini04,
   title =   " Inverse power and Durand Kerner iterations for univariate polynomial root finding",
   journal = " Comput Math Appl ",
 @Article{Bini04,
   title =   " Inverse power and Durand Kerner iterations for univariate polynomial root finding",
   journal = " Comput Math Appl ",

-  volume =  "",
-  number =  "47",
+  volume =  "47",
+  number =  "",

   pages =   "447-459",
   year =    "2004",
   author =  "DA. Bini AND L. Gemignani",
   pages =   "447-459",
   year =    "2004",
   author =  "DA. Bini AND L. Gemignani",


@@ -392,17 +457,18 @@ OPTannote = {•}
   year =    "1903",
   author =  "K. Weierstrass",
 }x
   year =    "1903",
   author =  "K. Weierstrass",
 }x

+@Manual{NVIDIA10,
+title = {NVIDIA CUDA C Programming Guide},
+OPTkey = {•},
+OPTauthor = {NVIDIA Corporation},
+OPTorganization = {Design Guide},
+OPTaddress = {•},
+OPTedition = {•},
+OPTmonth = {march},
+OPTyear = {2015},
+OPTnote = {•},
+OPTannote = {•}
+}

 
 
 
 
 
 

-@BOOK{NVIDIA10,
-  AUTHOR =       {NVIDIA},
-  editor =       {Design Guide},
-  TITLE =        {NVIDIA CUDA C Programming Guide},
-  PUBLISHER =    {PG},
-  YEAR =         {2015},
-  volume =       {7},
-  number =       {02829},
-  series =       {001},
-  month =        {march},
-}x