From: couturie Date: Tue, 20 Oct 2015 11:25:15 +0000 (+0200) Subject: new X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper1.git/commitdiff_plain/26140afc30d94e735cf20b19eede8c4a697563ee?hp=c6bec9299169e264ace308afa3d39e94b0769068 new --- diff --git a/biblio.bib b/biblio.bib deleted file mode 100644 index d90810b..0000000 --- a/biblio.bib +++ /dev/null @@ -1,414 +0,0 @@ -@Article{Aberth73, - author = "O. Aberth", - title = "Iteration Methods for Finding all Zeros of a Polynomial Simultaneously", - journal = "Mathematics of Computation", - volume = "27", - number = "122", - pages = "339--344", - year = "1973", - keywords = "RBBRS3, root finding,", -}x - - -@Article{Ilie50, - author = "L.Ilieff ", - title = "On the approximations of Newton", - journal = "Annual Sofia Univ", - volume = "", - number = "46", - pages = "167--171", - year = "1950", - keywords = "RBBRS3, root finding,", -}x -@Article{Docev62, - author = "K.Docev ", - 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", - pages = "136-139", - year = "1962", - keywords = "RBBRS3, root finding,", -}x - -@Article{Durand60, - author = "E.Durand ", - 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", - keywords = "RBBRS3, root finding,", -}x - -@Article{Kerner66, - author = "I.O.Kerner", - title = "Ein Gesamtschritteverfahren zur Berechnung der Nullstellen von Polynomen", - journal = " ", - volume = "", - number = "8", - pages = "290-294", - year = "1966", - keywords = "RBBRS3, root finding,", -}x - -@Article{Borch-Supan63, - author = "W.Borch-Supan", - title = "A posteriori error for the zeros of polynomials", - journal = " ", - volume = "", - number = "5", - pages = "380-398", - year = "1963", - keywords = "RBBRS3, root finding,", -}x - -@Article{Ehrlich67, - author = "L. W.Ehrlich", - title = "A modified Newton method for polynomials", - journal = " Comm. Ass. Comput. Mach.", - volume = "", - number = "10", - pages = "107-108", - year = "1967", - keywords = "RBBRS3, root finding,", -}x - -@Article{Loizon83, - author = "G.Loizon", - title = "Higher-order iteration functions for simultaneously approximating polynomial zeros", - journal = " Intern. J. Computer Math", - volume = "", - number = "14", - pages = "45-58", - year = "1983", - keywords = "simultaneously approximating, root finding,", -}x - -@Article{Freeman89, - author = "T.L.Freeman", - title = " Calculating polynomial zeros on a local memory parallel computer", - journal = " Parallel Computing", - volume = "", - number = "12", - pages = "351-358", - year = "1989", - keywords = "Parallel, root finding,", -}x - -@Article{Freemanall90, - author = "T.L.Freeman AND R.K.Brankin", - title = " Asynchronous polynomial zero-finding algorithms", - journal = " Parallel Computing", - volume = "", - number = "17", - pages = "673-681", - year = "1990", - keywords = "Parallel, root finding,", -}x - -@Article{Raphaelall01, - author = "C.Raphael AND S.François", - 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", - keywords = "Parallel, root finding,", -}x - -@Article{Ostrowski41, - author = "A.Ostrowski", - 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", - pages = "742-746", - year = "1941", - keywords = "Parallel, root finding,", -}x - - -@Manual{CUDA10, -title = {Compute Unified Device Architecture Programming Guide Version 3.0}, -OPTkey = {NVIDIA CUDA}, -OPTauthor = {•}, -OPTorganization = {NVIDIA CUDA}, -OPTaddress = {•}, -OPTedition = {•}, -OPTmonth = {March}, -OPTyear = {2010}, -OPTnote = {http://www.nvidia.com/object/cuda_develop.html}, -OPTannote = {•} -} - -@Article{Kahinall14, - author = "G.Kahina AND C.Raphael AND S.Abderrahmane", - 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", - year = "2014", - keywords = "Parallel, root finding,", -}x - -@Article{Karimall98, - author = "K.Rhofir,F.Spies, and Jean-Claude Miellou", - title = " Perfectionnements de la méthode asynchrone de Durand-Kerner pour les polynômes complexes", - journal = " Calculateurs Parallèles", - volume = "10", - number = "4", - pages = "449-458", - year = "1998", - keywords = "Parallel, root finding,", -}x - -@Article{Bini96, - author = "D.A.Bini", - title = " Numerical computation of polynomial zeros by means of Aberth s method", - journal = " Numerical Algorithms", - volume = "13", - number = "4", - pages = "179-200", - year = "1996", - keywords = "Parallel, root finding,", -}x - -@Article{Mirankar68, - author = "WL.Mirankar", - title = " Parallel methods for approximating the roots of a function", - journal = " IBM Res Dev", - volume = "30", - number = "", - pages = "297-301", - year = "1968", - keywords = "Parallel, root finding,", -}x - -@Article{Mirankar71, - author = "WL.Mirankar", - title = " A survey of parallelism in numerical analysis", - journal = " SIAM Rev", - volume = "", - number = "", - pages = "524-547", - year = "1971", - keywords = "Parallel, root finding,", -}x - -@Article{Schedler72, - author = "GS.Schedler", - title = " Parallel iteration methods in complexity of computer communications", - journal = " Commun ACM ", - volume = "", - number = "", - pages = "286-290", - year = "1967", - keywords = "Parallel, root finding,", -}x - -@Article{Winogard72, - author = "S.Winogard", - title = " Parallel iteration methods in complexity of computer communications", - journal = " Plenum, New York", - volume = "", - number = "", - pages = "", - year = "1972", - keywords = "Parallel, root finding,", -}x - -@Article{Benall68, - author = "M.Ben-Or AND E.Feig AND D.Kozzen AND P.Tiwary", - title = " A fast parallel algorithm for determining all roots of a polynomial with real roots", - journal = " Int: Proc of ACM", - volume = "", - number = "", - pages = "340-349", - year = "1968", - keywords = "Parallel, root finding,", -}x - -@Article{Riceall06, - author = "TA.Rice,LH.Jamieson", - title = " A highly parallel algorithm for root extraction", - journal = " IEEE Trans Comp", - volume = "38", - number = "3", - pages = "443-449", - year = "2006", - keywords = "Parallel, root finding,", -}x - -@Article{Cosnard90, - author = "M.Cosnard,P.Fraigniaud", - title = " Finding the roots of a polynomial on an MIMD multicomputer", - journal = " Parallel Comput", - volume = "15", - number = "3", - pages = "75-85", - year = "1990", - keywords = "Parallel, root finding,", -}x - -@Article{Janall99, - author = "PK.Jana,BP.Sinha,R.Datta Gupta", - title = " Efficient parallel algorithms for finding polynomial zeroes", - journal = "Proc of the 6th int conference on advance computing, CDAC, Pune University Campus,India", - volume = "15", - number = "3", - pages = "189-196", - year = "1999", - keywords = "Parallel, root finding,", -}x - -@Article{Jana06, - author = "PK.Jana", - title = " Polynomial interpolation and polynomial root finding on OTIS-Mesh", - journal = " Parallel Comput", - volume = "32", - number = "3", - pages = "301-312", - year = "2006", - keywords = "Parallel, root finding,", -}x -@Article{Kalantari08, - author = "B.Kalantari", - title = " Polynomial root finding and polynomiography.", - journal = " World Scientifict,New Jersey", - volume = "", - number = "", - pages = "", - year = "", - keywords = "Parallel, root finding,", -}x - -@Article{Gemignani07, - author = "L.Gemignani", - 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", - keywords = "Matrix, root finding,", -}x - - - -@Article{Skachek08, - author = "V.Skachek", - 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 = "2008", - keywords = "Matrix, root finding,", -}x - -@BOOK{Skachek008, - AUTHOR = {V.Skachek}, - editor = {}, - TITLE = {Probabilistic algorithm for finding roots of linearized polynomials}, - PUBLISHER = {codes and cryptography. Kluwer}, - YEAR = {2008}, - volume = {}, - number = {}, - series = {}, - address = {}, - edition = {Design}, - month = {}, - note = {}, - abstract = {}, - isbn = {}, - price = {}, - keywords = {}, - source = {}, -}x - -@Article{Zhancall08, - author = "X.Zhanc,M.Wan,Z.Yi", - title = " A constrained learning algorithm for finding multiple real roots of polynomial", - journal = " In: Proc of the 2008 intl symposium on computational intelligence and design", - volume = "", - number = "", - pages = "38-41", - year = "2008", - keywords = "Matrix, root finding,", -}x - - -@Article{Zhuall08, - author = "W.Zhu,w.Zeng,D.Lin", - title = " an adaptive algorithm finding multiple roots of polynomials", - journal = " Lect Notes Comput Sci ", - volume = "", - number = "5262", - pages = "674-681", - year = "2008", - keywords = "Matrix, root finding,", -}x -@Article{Azad07, - author = "HS.Azad", - title = " The performance of synchronous parallel polynomial root extraction on a ring multicomputer", - journal = " Clust Comput ", - volume = "2", - number = "10", - pages = "167-174", - year = "2007", - keywords = "Matrix, root finding,", -}x - - - - -@Article{Bini04, - author = "DA.Bini,L.Gemignani", - title = " Inverse power and Durand Kerner iterations for univariate polynomial root finding", - journal = " Comput Math Appl ", - volume = "", - number = "47", - pages = "447-459", - year = "2004", - keywords = "Matrix, root finding,", -}x - -@Article{Jana99, - author = "PK.Jana", - title = " Finding polynomial zeroes on a Multi-mesh of trees (MMT)", - journal = " In: Proc of the 2nd int conference on information technology", - volume = "", - number = "", - pages = "202-206", - year = "1999", - keywords = "Matrix, root finding,", -}x - -@Article{Weierstrass03, - author = "K.Weierstrass", - title = " Neuer Beweis des Satzes, dass jede ganze rationale function einer veranderlichen dagestellt werden kann als ein product aus linearen functionen derselben veranderlichen", - journal = " Ges. Werke", - volume = "3", - number = "", - pages = "251-269", - year = "1903", - keywords = "Neuer Beweis , root finding,", -}x - - - -@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