{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T04:35:47Z","timestamp":1792902947081,"version":"4.5.0"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Mag."],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1109\/msp.2003.1253552","type":"journal-article","created":{"date-parts":[[2004,3,9]],"date-time":"2004-03-09T14:14:08Z","timestamp":1078841648000},"page":"27-42","source":"Crossref","is-referenced-by-count":60,"title":["Factoring very-high-degree polynomials"],"prefix":"10.1109","volume":"20","author":[{"given":"G.A.","family":"Sitton","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.S.","family":"Burrus","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.W.","family":"Fox","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Treitel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"78","article-title":"A method of factoring long z-transform polynomials","author":"Lindsey","year":"1992","journal-title":"Comput Methods Geosciences, SIAM"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144595288554"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1511\/1998.17.915"},{"issue":"2","key":"ref4","first-page":"108","article-title":"Another algorithm","volume":"86","author":"Traub","year":"1998","journal-title":"Amer. Sci."},{"key":"ref5","volume-title":"Discrete-Time Signal Processing.","author":"Oppenheim","year":"1989"},{"key":"ref6","volume-title":"DFT\/FFT and Convolution Algorithms.","author":"Burrus","year":"1985"},{"key":"ref7","article-title":"Improving the accuracy of polynomial evaluation, deflation, and root finding","author":"Fox","year":"2002","journal-title":"draft manuscript"},{"key":"ref8","volume-title":"Numerical Recipes in Fortran: The Art of Scientific Computing","author":"Press","year":"1992"},{"key":"ref9","article-title":"An algorithm for factoring a polynomial of a complex variable","author":"Burrus","year":"2000","journal-title":"unpublished notes, ECE Dept., Rice Univ."},{"key":"ref10","article-title":"Using the FFT to factor polynomials","author":"Fox","year":"2001"},{"key":"ref11","volume-title":"Accuracy and Stability of Numerical Algorithms.","author":"Higham","year":"1996"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF03026609"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1119\/1.13295"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01140538"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/31.41294"},{"key":"ref16","article-title":"Newton, Laguerre, and Zeno","author":"Fox","year":"2002"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1090\/spec\/002"},{"key":"ref18","article-title":"Factoring ultra-high degree polynomials","author":"Fox","year":"2003"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1982.1163975"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977523"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/321386.321393"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/17.1.99"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01933524"},{"key":"ref24","volume-title":"Complex Analysis","author":"Ahlfors","year":"1966"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1987.1165220"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1977.1162894"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1049\/el:19990658"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2740-3_38"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1995-1308023-8"},{"key":"ref30","volume-title":"Matrix Computations","author":"Golub","year":"1996"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/97.329845"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/0707045"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050058"},{"key":"ref34","article-title":"A fast and efficient program for finding all polynomial roots","volume-title":"Proc. Int. Symp. Circuits and Systems, ISCAS-94)","author":"Lang","year":"1994"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.21236\/ADA631175"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050069"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/0915064"},{"key":"ref38","article-title":"Polynomial root finding using iterated eigenvalue computation","author":"Fortune","year":"2000","journal-title":"Center for Discrete Mathematics & Theoretical Computer Science, NSF Science & Technology Center, Rutgers Univ., Tech. Rep."},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(93)90064-I"},{"key":"ref40","article-title":"Weyl\u2019s complex polynomial root finding method: A parallel implementation","volume-title":"Proc. 5th Eur. SCI\/Cray MPP Workshop","author":"Fanton","year":"1999"},{"key":"ref41","article-title":"On the rates of convergence of the Newton-Raphson method: A computer experiment","author":"Li","year":"1986","journal-title":"Dept. Physics, SUNY, Plattsburgh, NY, Tech. Rep."},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1977.1170353"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/BF02017352"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1190\/1.1439523"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1977.1162923"},{"key":"ref46","first-page":"301","article-title":"A note on phase unwrapping","author":"Lindsey","year":"1996","journal-title":"Soc. Explor. Geophys."},{"key":"ref47","first-page":"725","article-title":"Polynomial factorization and phase unwrapping","author":"Fox","year":"1996","journal-title":"Soc. Explor. Geophys."}],"container-title":["IEEE Signal Processing Magazine"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/79\/28049\/01253552.pdf?arnumber=1253552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T04:15:12Z","timestamp":1792901712000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1253552\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":47,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,11]]}},"URL":"https:\/\/doi.org\/10.1109\/msp.2003.1253552","relation":{},"ISSN":["1053-5888"],"issn-type":[{"value":"1053-5888","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}