{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:49:46Z","timestamp":1761806986978},"reference-count":42,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/0167-8191(90)90032-5","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"75-85","source":"Crossref","is-referenced-by-count":45,"title":["Finding the roots of a polynomial on an MIMD multicomputer"],"prefix":"10.1016","volume":"15","author":[{"given":"Michel","family":"Consnard","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"22","key":"10.1016\/0167-8191(90)90032-5_BIB1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0025-5718-1973-0329236-7","article-title":"Iteration methods for finding all zeros of a polynomial simultaneously","volume":"27","author":"Aberth","year":"1973","journal-title":"Math. Comp."},{"issue":"2","key":"10.1016\/0167-8191(90)90032-5_BIB2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1137\/0711023","article-title":"On the convergence speed of some algorithms for the simultaneous approximation of polynomial roots","volume":"11","author":"Alefeld","year":"1974","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"10.1016\/0167-8191(90)90032-5_BIB3","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0041-5553(82)90179-3","article-title":"Methods for the simultaneous approximate derivation of the roots of algebraic, trigonometric and exponential equations","volume":"22","author":"Angelova","year":"1982","journal-title":"USRR Comput. Maths. Math. Phys."},{"key":"10.1016\/0167-8191(90)90032-5_BIB4","series-title":"Proc. ACM","first-page":"340","article-title":"A fast parallel algorithm for determining all roots of a polynomial with real roots","author":"Ben-Or","year":"1986"},{"key":"10.1016\/0167-8191(90)90032-5_BIB5","first-page":"433","article-title":"Strategies for interconnection networks: some methods from graph theory","volume":"3","author":"Bermond","year":"1986","journal-title":"JPDC"},{"key":"10.1016\/0167-8191(90)90032-5_BIB6","series-title":"Hypercube and Distributed Computers","first-page":"279","article-title":"de Bruijn and Kautz networks: a competitor for the hypercube?","author":"Bermond","year":"1989"},{"key":"10.1016\/0167-8191(90)90032-5_BIB7","series-title":"Research Report","article-title":"On the complexity of polynomial zeros","author":"Bini","year":"1989"},{"key":"10.1016\/0167-8191(90)90032-5_BIB8","series-title":"Hypercube and Distributed Computers","first-page":"93","article-title":"Communication benchmarks for the iPSC\/2","author":"Bomans","year":"1989"},{"key":"10.1016\/0167-8191(90)90032-5_BIB9","unstructured":"M.L. Lo Cascio, L. Pasquini and D. Trigiante, Simultaneous determination of polynomial complex roots and multiplicities: algorithm and problems involved, Tech. Report Dip. di Metodi e Modelli Matematici per le scienze Applicate, Univ. Roma La Sapienza."},{"issue":"10","key":"10.1016\/0167-8191(90)90032-5_BIB10","doi-asserted-by":"crossref","first-page":"1285","DOI":"10.1109\/12.5991","article-title":"On embedding rectangular grids in hypercubes","volume":"37","author":"Chan","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90032-5_BIB11","series-title":"Technical Report LIP-IMAG 89-02","article-title":"Tnode: document utilisateur","author":"Champion","year":"1989"},{"key":"10.1016\/0167-8191(90)90032-5_BIB12","series-title":"Parallel Computing 89","article-title":"Asynchronous Durand-Kerner and Aberth polynomial root finding methods on a distributed memory multicomputer","author":"Cosnard","year":"1989"},{"key":"10.1016\/0167-8191(90)90032-5_BIB13","series-title":"Research Report, LIP-IMAG","article-title":"Asynchronous and analytic polynomial root finding methods on a distributed memory multicomputer","author":"Cosnard","year":"1990"},{"key":"10.1016\/0167-8191(90)90032-5_BIB14","series-title":"Solutions Num\u00e9riques de Equations Alg\u00e9briques, Tome 1: Equations du Type F(x) = 0; Racines d'un Polyn\u00f4me","author":"Durand","year":"1960"},{"issue":"2","key":"10.1016\/0167-8191(90)90032-5_BIB15","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/363067.363115","article-title":"A modified Newton method for polynomials","volume":"10","author":"Ehrlich","year":"1967","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8191(90)90032-5_BIB16","first-page":"427","article-title":"An algorithm for the total, or partial, factorization of a polynomial","volume":"82","author":"Farmer","year":"1977"},{"key":"10.1016\/0167-8191(90)90032-5_BIB17","unstructured":"P. Fraigniaud, The Durand-Kerner polynomials root finding method in case of multiple roots, to appear in BIT."},{"key":"10.1016\/0167-8191(90)90032-5_BIB18","series-title":"Hypercube and Distuted Computers","first-page":"311","article-title":"Performance analysis of broadcasting in hypercubes","author":"Fraigniaud","year":"1989"},{"key":"10.1016\/0167-8191(90)90032-5_BIB19","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0167-8191(90)90140-5","article-title":"Scattering on a ring of processors","volume":"13","author":"Fraigniaud","year":"1990","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(90)90032-5_BIB20","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0167-8191(89)90093-8","article-title":"Calculating polynomial zeros on a local memory parallel computer","volume":"12","author":"Freeman","year":"1989","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(90)90032-5_BIB21","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1137\/1018091","article-title":"Simultaneous iteration towards all roots of a complex polynomial","volume":"18","author":"Green","year":"1976","journal-title":"SIAM Rev"},{"key":"10.1016\/0167-8191(90)90032-5_BIB22","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BF01935059","article-title":"Initial approximations in Durand-Kerner's root finding method","volume":"26","author":"Guggenheimer","year":"1986","journal-title":"BIT"},{"key":"10.1016\/0167-8191(90)90032-5_BIB23","article-title":"Calcul simultan\u00e9 des racines d'un polynome complexe: contribution \u00e0 l'algorithmique et mise en oeuvre sur un r\u00e9seau de processeu","author":"Hoxha","year":"1988","journal-title":"Th\u00e8se de l'institut National Polytechnique de Toulouse"},{"key":"10.1016\/0167-8191(90)90032-5_BIB24","first-page":"9","article-title":"Optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Ho","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90032-5_BIB25","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF02162564","article-title":"Ein gesamtschrittverfahren zur berechnung der nullstellen von polynomen","volume":"8","author":"Kerner","year":"1966","journal-title":"Numer. Math."},{"key":"10.1016\/0167-8191(90)90032-5_BIB26","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/BF01934913","article-title":"Two observations on Durand-Kerner root-finding method","volume":"24","author":"Kjellberg","year":"1984","journal-title":"BIT"},{"issue":"4","key":"10.1016\/0167-8191(90)90032-5_BIB27","article-title":"Evaluating the performances of Transputer based hypercube vector computer","author":"Kuppuswami","year":"1990","journal-title":"Lettre du Transputer"},{"issue":"5","key":"10.1016\/0167-8191(90)90032-5_BIB28","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0041-5553(84)90165-4","article-title":"Methods for finding simultaneously all the roots of algebraic, trigonometric, and exponential equations","volume":"24","author":"Makrelov","year":"1984","journal-title":"USSR Comput. Maths. Math. Phys."},{"key":"10.1016\/0167-8191(90)90032-5_BIB29","series-title":"Localisation des zeros de polyn\u00f4mes intervenant en th\u00e9orie du signal","author":"Nicolas","year":"1989"},{"issue":"8","key":"10.1016\/0167-8191(90)90032-5_BIB30","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/0898-1221(87)90186-6","article-title":"Sequential and parallel complexity of approximate evaluation of polynomial zeros","volume":"14","author":"Pan","year":"1987","journal-title":"Comput. Math. Appl."},{"issue":"169","key":"10.1016\/0167-8191(90)90032-5_BIB31","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1090\/S0025-5718-1985-0771036-6","article-title":"A globally convergent method for simultaneously finding polynomial roots","volume":"44","author":"Paquini","year":"1985","journal-title":"Math. Comp."},{"key":"10.1016\/0167-8191(90)90032-5_BIB32","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01937359","article-title":"On some iteration functions for the simultaneous computation of multiply complex polynomial zeros","volume":"28H7","author":"Petkovic","year":"1987","journal-title":"BIT"},{"key":"10.1016\/0167-8191(90)90032-5_BIB33","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02165226","article-title":"Convergence of the Newton process to multiple solutions","volume":"9","author":"Rall","year":"1966","journal-title":"Numer. Math."},{"issue":"7","key":"10.1016\/0167-8191(90)90032-5_BIB34","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","article-title":"Topological properties of hypercubes","volume":"37","author":"Saad","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90032-5_BIB35","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0167-8191(89)90024-0","article-title":"Data communication in parallel architectures","volume":"11","author":"Saad","year":"1989","journal-title":"Parallel Comput."},{"issue":"10","key":"10.1016\/0167-8191(90)90032-5_BIB36","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1109\/12.5990","article-title":"Minimal mesh embeddings in binary hypercubes","volume":"37","author":"Scott","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90032-5_BIB37","series-title":"Intensive hypercube communication I","author":"Stout","year":"1987"},{"issue":"3","key":"10.1016\/0167-8191(90)90032-5_BIB38","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1109\/12.21130","article-title":"A highly parallel algorithm for root extraction","volume":"28","author":"Rice","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90032-5_BIB39","unstructured":"S. Smale, On the efficiency of algorithms of analysis, Technical Report Math. Dept., UC, Berkeley, CA."},{"key":"10.1016\/0167-8191(90)90032-5_BIB40","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02247945","article-title":"The Durand-Kerner methods for trigonometric and exponential polynomials","volume":"40","author":"Weidner","year":"1988","journal-title":"Computing"},{"key":"10.1016\/0167-8191(90)90032-5_BIB41","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/BFb0069383","article-title":"On the simultaneous determination of polynomial roots","volume":"953","author":"Werner","year":"1982","journal-title":"Lecture Notes in Mathematics"},{"key":"10.1016\/0167-8191(90)90032-5_BIB42","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BF01386381","article-title":"The evalution of the zeros of ill-conditioned polynomials, Part I and II","volume":"1","author":"Wilkinson","year":"1959","journal-title":"Numer. Math."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819190900325?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819190900325?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:26:15Z","timestamp":1551068775000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819190900325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":42,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["0167819190900325"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90032-5","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}