{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:17:48Z","timestamp":1772284668353,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numerical Algorithms"],"published-print":{"date-parts":[[1999,8]]},"DOI":"10.1023\/a:1019116203957","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T23:30:27Z","timestamp":1045697427000},"page":"323-329","source":"Crossref","is-referenced-by-count":4,"title":["On the parallel evaluation of a sparse polynomial at a point"],"prefix":"10.1007","volume":"20","author":[{"given":"Dario Andrea","family":"Bini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Fiorentino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"122","key":"329307_CR1","doi-asserted-by":"publisher","first-page":"339","DOI":"10.2307\/2005621","volume":"27","author":"O. Aberth","year":"1973","unstructured":"O. Aberth, Iteration methods for finding all zeros of a polynomial simultaneously, Math. Comp. 27(122) (1973) 339\u2013344.","journal-title":"Math. Comp."},{"key":"329307_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF02207694","volume":"13","author":"D.A. Bini","year":"1996","unstructured":"D.A. Bini, Numerical computation of polynomial zeros by means of Aberth's method, Numer. Algorithms 13 (1996) 179\u2013200.","journal-title":"Numer. Algorithms"},{"key":"329307_CR3","unstructured":"D.A. Bini and V. Burchielli, Mpsolve 1.0: A Fortran 90 Package for the numerical computation of polynomial roots, Technical Report, Dipartimento di Matematica, Universit\u00e0 di Pisa (1997)."},{"key":"329307_CR4","first-page":"53","volume-title":"Proc. of the 1st Internat. MATHEMATICA Symposium","author":"D.A. Bini","year":"1995","unstructured":"D.A. Bini and G. Fiorentino, Adaptive multiprecision algorithm for univariate polynomial zeros, in: Proc. of the 1st Internat. MATHEMATICA Symposium (Computational Mechanics Publications, Southampton, 1995) pp. 53\u201360."},{"key":"329307_CR5","unstructured":"D.A. Bini and G. Fiorentino, A multiprecision implementation of a poly-algorithm for univariate polynomial zeros, in: Proc. of the POSSO Workshop on Software, eds. J.C. Faug\u00e8re, J. Marchand and R. Rioboo (1995)."},{"key":"329307_CR6","unstructured":"D.A. Bini and G. Fiorentino, Mpsolve: Numerical computation of polynomial roots v2.0, Technical FRISCO Report (1998)."},{"key":"329307_CR7","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/BF01385904","volume":"5","author":"W. B\u00f6rsch-Supan","year":"1963","unstructured":"W. B\u00f6rsch-Supan, A-posteriori error bounds for the zeros of polynomials, Numer. Math. 5 (1963) 380\u2013398.","journal-title":"Numer. Math."},{"key":"329307_CR8","volume-title":"Solutions Num\u00e9riques des \u00c9quations Alg\u00e9briques, Tome 1: Equations du Type F(X) = 0; Racines d'un Polyn\u00f4me","author":"E. Durand","year":"1960","unstructured":"E. Durand, Solutions Num\u00e9riques des \u00c9quations Alg\u00e9briques, Tome 1: Equations du Type F(X) = 0; Racines d'un Polyn\u00f4me (Masson, Paris, 1960)."},{"issue":"2","key":"329307_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/363067.363115","volume":"10","author":"L.W. Ehrlich","year":"1967","unstructured":"L.W. Ehrlich, A modified Newton method for polynomials, Comm. ACM 10(2) (1967) 107\u2013108.","journal-title":"Comm. ACM"},{"key":"329307_CR10","doi-asserted-by":"crossref","unstructured":"E. Hansen, M. Patrick and J. Rusnak, Some modifications of Laguerre's method, BIT 17 (1977) 409\u2013417.","DOI":"10.1007\/BF01933450"},{"key":"329307_CR11","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/BF02163334","volume":"14","author":"M.A. Jenkins","year":"1970","unstructured":"M.A. Jenkins and J.F. Traub, A three stage variable shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration, Numer. Math. 14 (1970) 252\u2013263.","journal-title":"Numer. Math."},{"key":"329307_CR12","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF02162564","volume":"8","author":"I.O. Kerner","year":"1966","unstructured":"I.O. Kerner, Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen, Numer. Math. 8 (1966) 290\u2013294.","journal-title":"Numer. Math."},{"key":"329307_CR13","series-title":"Technical Report HL","volume-title":"Fortran subroutines for finding polynomial zeros","author":"K. Madsen","year":"1975","unstructured":"K. Madsen and J. Reid, Fortran subroutines for finding polynomial zeros, Technical Report HL 75\/1172(C.13), Computer Science and Systems Divisions, A.E.R.E. Harwell, Oxford (1975)."},{"key":"329307_CR14","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/BF01600333","volume":"5","author":"V.H. Maehly","year":"1954","unstructured":"V.H. Maehly, Zur iterativen Aufl\u00f6sing algebraischer Gleichungen, Z. Angew. Math. Phys. 5 (1954) 260\u2013263.","journal-title":"Z. Angew. Math. Phys."},{"key":"329307_CR15","first-page":"49","volume":"34","author":"S. Tri\u010dkovi\u0107","year":"1997","unstructured":"S. Tri\u010dkovi\u0107 M.S. Petkovi\u0107 and S. Ili\u0107, A family of simultaneous zero finding methods, Comput. Math. Appl. 34 (1997) 49\u201359.","journal-title":"Comput. Math. Appl."},{"key":"329307_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0771-050X(77)90006-7","volume":"3","author":"A.W.M. Nourein","year":"1977","unstructured":"A.W.M. Nourein, An improvement on Nourein's method for the simultaneous determination of the zeros of a polynomial (an algorithm), J. Comput. Appl. Math. 3 (1977) 109\u2013110.","journal-title":"J. Comput. Appl. Math."},{"key":"329307_CR17","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1080\/00207167708803141","volume":"6","author":"A.W.M. Nourein","year":"1977","unstructured":"A.W.M. Nourein, An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial, Internat. J. Comput. Math. 6 (1977) 241\u2013252.","journal-title":"Internat. J. Comput. Math."},{"issue":"1","key":"329307_CR18","first-page":"103","volume":"21","author":"V.Y. Pan","year":"1966","unstructured":"V.Y. Pan, On methods of computing the values of polynomials, Uspekhi Mat. Nauk 21(1) (127) (1966) 103\u2013134.","journal-title":"Uspekhi Mat. Nauk"},{"key":"329307_CR19","first-page":"251","volume-title":"Gesammelte Werke","author":"K. Weierstrass","year":"1903","unstructured":"K. Weierstrass, Neuer Beweis des Satzes, dass jede ganze rationale Funktion einer Ver\u00e4nderlichen dargestellt werden kann als ein Product aus linearen Functionen derselben Ver\u00e4nderlichen, in: Gesammelte Werke, Vol. 3 (1903), pp. 251\u2013269. (Johnson Reprint Corp., New York, 1967.)"},{"key":"329307_CR20","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/BFb0069383","volume-title":"On the simultaneous determination of polynomial roots","author":"W. Werner","year":"1982","unstructured":"W. Werner, On the simultaneous determination of polynomial roots, Lecture Notes in Mathematics 953 (Springer, New York, 1982) pp. 188\u2013202."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019116203957.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019116203957\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019116203957.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T06:48:12Z","timestamp":1751870892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019116203957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,8]]}},"alternative-id":["329307"],"URL":"https:\/\/doi.org\/10.1023\/a:1019116203957","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,8]]}}}