{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T14:27:41Z","timestamp":1725719261474},"reference-count":54,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4337,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1006\/jcom.2001.0585","type":"journal-article","created":{"date-parts":[[2002,9,18]],"date-time":"2002-09-18T13:38:25Z","timestamp":1032356305000},"page":"541-573","source":"Crossref","is-referenced-by-count":11,"title":["On the Geometry of Graeffe Iteration"],"prefix":"10.1006","volume":"17","author":[{"given":"Gregorio","family":"Malajovich","sequence":"first","affiliation":[]},{"given":"Jorge P.","family":"Zubelli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jcom.2001.0585_RF1","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1145\/321043.321049","article-title":"Resultant procedure and the mechanization of the Graeffe process","volume":"7","author":"Bareiss","year":"1960","journal-title":"J. Assoc. Comput. Machin."},{"key":"10.1006\/jcom.2001.0585_RF2","series-title":"Mathematical Methods for Digital Computers","first-page":"185","article-title":"The numerical solution of polynomial equations and the resultant procedures","author":"Bareiss","year":"1967"},{"key":"10.1006\/jcom.2001.0585_RF3","doi-asserted-by":"crossref","first-page":"2607","DOI":"10.1090\/S0002-9947-1995-1277095-1","article-title":"Differential identities","volume":"347","author":"Beauzamy","year":"1995","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1006\/jcom.2001.0585_RF4","series-title":"Polynomial and Matrix Computations","volume":"1","author":"Bini","year":"1994"},{"key":"10.1006\/jcom.2001.0585_RF5","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1006\/jcom.1996.0030","article-title":"Graeffe's Chebyshev-like and Cardinal's processes for splitting a polynomial into factors","volume":"12","author":"Bini","year":"1996","journal-title":"J. Complexity"},{"key":"10.1006\/jcom.2001.0585_RF6","series-title":"Computational Solution of Nonlinear Systems of Equations","article-title":"On the geometry of factorization algorithms","author":"Blish","year":"1990"},{"key":"10.1006\/jcom.2001.0585_RF7","series-title":"Complexity and Real Computation","author":"Blum","year":"1998"},{"key":"10.1006\/jcom.2001.0585_RF8","series-title":"The Mathematics of Numerical Analysis. 1995 AMS\u2013SIAM Summer Seminar in Applied Mathematics, July 17\u2013August 11, 1995, Park City, UT","article-title":"On two iterative methods for approximating the roots of a polynomial","volume":"32","author":"Cardinal","year":"1996"},{"key":"10.1006\/jcom.2001.0585_RF9","first-page":"1019","article-title":"A propos de la m\u00e9thode de Graeffe","volume":"309","author":"Dedieu","year":"1989","journal-title":"C. R. Acad. Sci. Paris"},{"key":"10.1006\/jcom.2001.0585_RF10","series-title":"The Mathematics of Numerical Analysis. 1995 AMS\u2013SIAM Summer Seminar in Applied Mathematics, July 17\u2013August 11, 1995, Park City, UT","first-page":"263","article-title":"Approximate solutions of numerical problems, condition number analysis and condition number theorem","volume":"32","author":"Dedieu","year":"1996"},{"key":"10.1006\/jcom.2001.0585_RF11","series-title":"Foundations of Computational Mathematics\u2013Selected Papers of a Conference held at IMPA in Rio de Janeiro, Jan 1997","first-page":"75","article-title":"Condition number analysis for sparse polynomial systems","author":"Dedieu","year":"1997"},{"key":"10.1006\/jcom.2001.0585_RF12","series-title":"Applied Numerical Linear Algebra","author":"Demmel","year":"1997"},{"key":"10.1006\/jcom.2001.0585_RF13","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1090\/S0025-5718-1995-1262279-2","article-title":"Polynomial roots from companion matrix eigenvalues","volume":"64","author":"Edelman","year":"1995","journal-title":"Math. Comput."},{"key":"10.1006\/jcom.2001.0585_RF14","series-title":"The Mathematics of Numerical Analysis. 1995 AMS\u2013SIAM Summer Seminar in Applied Mathematics, July 17\u2013August 11, 1995, Park City, UT","article-title":"Numerical univariate polynomial GCD","volume":"32","author":"Emiris","year":"1996"},{"key":"10.1006\/jcom.2001.0585_RF15","doi-asserted-by":"crossref","DOI":"10.1007\/BF01020332","article-title":"Quantitative universality for a class of nonlinear transformations","volume":"19","author":"Feigenbaum","year":"1978","journal-title":"J. Statist. Phys."},{"key":"10.1006\/jcom.2001.0585_RF16","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1137\/0915064","article-title":"Remark on algorithms to find roots of polynomials","volume":"15","author":"Goedecker","year":"1994","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1006\/jcom.2001.0585_RF17","doi-asserted-by":"crossref","DOI":"10.1145\/321186.321198","article-title":"On the reduction of number range in the use of the Graeffe process","author":"Grau","year":"1963","journal-title":"J. Assoc. Comput. Machin."},{"key":"10.1006\/jcom.2001.0585_RF18","series-title":"Applied and Computational Complex Analysis","author":"Henrici","year":"1974"},{"key":"10.1006\/jcom.2001.0585_RF19","series-title":"Accuracy and Stability of Numerical Algorithms","author":"Higham","year":"1996"},{"key":"10.1006\/jcom.2001.0585_RF20","doi-asserted-by":"crossref","first-page":"464","DOI":"10.2307\/2310626","article-title":"Dandelin, Lobatchevskii, or Graeffe?","volume":"66","author":"Householder","year":"1959","journal-title":"Amer. Math. Monthly"},{"key":"10.1006\/jcom.2001.0585_RF21","series-title":"Charles Babbage, Pioneer of the Computer","author":"Hyman","year":"1982"},{"key":"10.1006\/jcom.2001.0585_RF22","doi-asserted-by":"crossref","DOI":"10.1007\/BF02163334","article-title":"A three-stage variable shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration","volume":"14","author":"Jenkins","year":"1970","journal-title":"Numer. Math."},{"key":"10.1006\/jcom.2001.0585_RF23","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1006\/jcom.1998.0481","article-title":"Partial fraction decomposition in Cn and simultaneous Newton iteration for factorization in C[z]","volume":"14","author":"Kirrinnis","year":"1998","journal-title":"J. Complexity"},{"key":"10.1006\/jcom.2001.0585_RF24","series-title":"Foundations of Computational Mathematics\u2013Selected Papers of a Conference held at IMPA in Rio de Janeiro, Jan 1997","first-page":"193","article-title":"Newton iteration towards a cluster of polynomial zeros","author":"Kirrinnis","year":"1997"},{"key":"10.1006\/jcom.2001.0585_RF25","unstructured":"E. Kostlan, Random polynomials and the statistical fundamental theorem of algebra, preprint, MSRI, 1987."},{"key":"10.1006\/jcom.2001.0585_RF26","series-title":"From Topology to Computation: Proceedings of the Smalefest (Berkeley, CA, 1990)","author":"Kostlan","year":"1993"},{"key":"10.1006\/jcom.2001.0585_RF27","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0304-3975(94)00065-4","article-title":"On generalized Newton algorithms: Quadratic convergence, path-following and error analysis","volume":"133","author":"Malajovich","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1006\/jcom.2001.0585_RF28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0898-1221(96)00233-7","article-title":"A fast and stable algorithm for splitting polynomials","volume":"33","author":"Malajovich","year":"1997","journal-title":"Comput. Math. Appl."},{"key":"10.1006\/jcom.2001.0585_RF29","unstructured":"G. Malajovich and J. P. Zubelli, Tangent, Graeffe Iteration, Informes de Matem\u00e1tica, Serie B, Vol. 119, pp. 1\u201334, IMPA, Junho, 1998, Numer. Math., to appear."},{"key":"10.1006\/jcom.2001.0585_RF30","series-title":"Complex Dynamics and Renormalization","volume":"135","author":"McMullen","year":"1994"},{"key":"10.1006\/jcom.2001.0585_RF31","series-title":"One-dimensional Dynamics","author":"de Melo","year":"1993"},{"key":"10.1006\/jcom.2001.0585_RF32","series-title":"Foundations of Computational Mathematics\u2014Selected Papers of a Conference held at IMPA in Rio de Janeiro, Jan. 1997","first-page":"287","article-title":"Solving special polynomial systems by using structured matrices and algebraic residues","author":"Mourrain","year":"1997"},{"key":"10.1006\/jcom.2001.0585_RF33","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1006\/jcom.1996.0008","article-title":"An efficient algorithm for the complex roots problem","volume":"12","author":"Neff","year":"1996","journal-title":"J. Complexity"},{"key":"10.1006\/jcom.2001.0585_RF34","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1006\/jcom.1996.0024","article-title":"Topological complexity of zero-finding","volume":"12","author":"Novak","year":"1996","journal-title":"J. Complexity"},{"key":"10.1006\/jcom.2001.0585_RF35","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02546329","article-title":"Recherches sur la M\u00e9thode de Graeffe et les Z\u00e9ros de Polynomes et des S\u00e9ries de Laurent","volume":"72","author":"Ostrowskii","year":"1940","journal-title":"Acta Math."},{"key":"10.1006\/jcom.2001.0585_RF36","series-title":"Hyberbolicity and Sensitive Chaotic Dynamics at Homoclinic Bifurcations","volume":"35","author":"Palis","year":"1993"},{"key":"10.1006\/jcom.2001.0585_RF37","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0898-1221(95)00078-D","article-title":"Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant","volume":"30","author":"Pan","year":"1995","journal-title":"Comput. Math. Appl."},{"key":"10.1006\/jcom.2001.0585_RF38","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0898-1221(96)00080-6","article-title":"Optimal and nearly optimal algorithms for approximating polynomial zeros","volume":"31","author":"Pan","year":"1996","journal-title":"Comput. Math. Appl."},{"key":"10.1006\/jcom.2001.0585_RF39","doi-asserted-by":"crossref","DOI":"10.1137\/S0036144595288554","article-title":"Solving a polynomial equation: Some history and recent progress","volume":"39","author":"Pan","year":"1997","journal-title":"SIAM Rev."},{"key":"10.1006\/jcom.2001.0585_RF40","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1006\/jcom.1996.0034","article-title":"On isolation of real and nearly real zeros of a univariate polynomial and its splitting into factors","volume":"12","author":"Pan","year":"1996","journal-title":"J. Complexity"},{"key":"10.1006\/jcom.2001.0585_RF41","article-title":"Sur la m\u00e9thode de Graeffe","author":"P\u00f3lya","year":"1913","journal-title":"Compt. Rend. Acad. Sci. Paris"},{"key":"10.1006\/jcom.2001.0585_RF42","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF01582052","article-title":"On the cost of approximating all roots of a complex polynomial","volume":"32","author":"Renegar","year":"1985","journal-title":"Math. Programming"},{"key":"10.1006\/jcom.2001.0585_RF43","article-title":"On the complexity of Bezout's theorem. I. Geometric aspects","volume":"6","author":"Shub","year":"1993","journal-title":"J. Amer. Math. Soc."},{"key":"10.1006\/jcom.2001.0585_RF44","series-title":"Computational Algebraic Geometry","first-page":"267","article-title":"On the complexity of Bezout's theorem. II. Volumes and probabilities","author":"Shub","year":"1993"},{"key":"10.1006\/jcom.2001.0585_RF45","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1006\/jcom.1993.1002","article-title":"On the complexity of Bezout's theorem. III. Condition number and packing","volume":"9","author":"Shub","year":"1993","journal-title":"J. Complexity"},{"key":"10.1006\/jcom.2001.0585_RF46","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0733008","article-title":"Complexity of Bezout's theorem. IV. Probability of success; extensions","volume":"33","author":"Shub","year":"1996","journal-title":"Siam J. Numer. Anal."},{"key":"10.1006\/jcom.2001.0585_RF47","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(94)90122-8","article-title":"Complexity of Bezout's theorem. V. Polynomial time","volume":"133","author":"Shub","year":"1994","journal-title":"Theoret. Computer Sci."},{"key":"10.1006\/jcom.2001.0585_RF48","doi-asserted-by":"crossref","unstructured":"S. Smale, Complexity theory and numerical analysis, preprint, Hong Kong, 1996;, Acta Numerica, to appear.","DOI":"10.1017\/S0962492900002774"},{"key":"10.1006\/jcom.2001.0585_RF49","unstructured":"A. Sch\u00f6nhage, The fundamental theorem of algebra in terms of computational complexity\u2014preliminary report, preprint, T\u00fcbingen, 1982."},{"key":"10.1006\/jcom.2001.0585_RF50","series-title":"Proceedings of the international Congress of Mathematics, Berkeley, 1986","article-title":"Equation solving in terms of computational complexity","author":"Sch\u00f6nhage","year":"1987"},{"key":"10.1006\/jcom.2001.0585_RF51","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s002110050069","article-title":"Pseudozeros of polynomials and pseudospectra of companion matrices","volume":"68","author":"Toh","year":"1994","journal-title":"Numer. Math."},{"key":"10.1006\/jcom.2001.0585_RF52","series-title":"Theory of Equations","author":"Uspensky","year":"1948"},{"key":"10.1006\/jcom.2001.0585_RF53","series-title":"The Mathematics of Numerical Analysis. 1995 AMS\u2013SIAM Summer Seminar in Applied Mathematics, July 17\u2013August 11, 1995, Park City, UT","article-title":"Topological complexity of root-finding algorithms","volume":"32","author":"Vassiliev","year":"1996"},{"key":"10.1006\/jcom.2001.0585_RF54","unstructured":"H. Weil, The Theory of Groups and Quantum Mechanics, Dover, New York, 1931, 1951."}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X01905850?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X01905850?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T15:30:02Z","timestamp":1576510202000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0885064X01905850"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0885064X01905850"],"URL":"https:\/\/doi.org\/10.1006\/jcom.2001.0585","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}