{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T07:49:47Z","timestamp":1769500187504,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,11,19]],"date-time":"2015-11-19T00:00:00Z","timestamp":1447891200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10208-015-9289-1","type":"journal-article","created":{"date-parts":[[2015,11,19]],"date-time":"2015-11-19T20:54:17Z","timestamp":1447966457000},"page":"259-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The Numerical Factorization of Polynomials"],"prefix":"10.1007","volume":"17","author":[{"given":"Wenyuan","family":"Wu","sequence":"first","affiliation":[]},{"given":"Zhonggang","family":"Zeng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,19]]},"reference":[{"key":"9289_CR1","doi-asserted-by":"crossref","unstructured":"E. Kaltofen, Polynomial factorization: a success story, Proc. of ISSAC\u201903, ACM Press (2003), 3\u20134.","DOI":"10.1145\/860854.860857"},{"key":"9289_CR2","doi-asserted-by":"crossref","unstructured":"E. Kaltofen, Challenges of symbolic computation: My favorite open problems, J. Symb. Comput., 29 (2000), 161\u2013168.","DOI":"10.1006\/jsco.2000.0370"},{"key":"9289_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and Real Computation","author":"L Blum","year":"1998","unstructured":"L. Blum, F. Cucker, M. Shub and S. Smale, Complexity and Real Computation, Springer-Verlag, New York, 1998."},{"key":"9289_CR4","doi-asserted-by":"crossref","unstructured":"J.-P. Dedieu and M. Shub, Newton\u2019s method for overdetermined system of equations, Mathematics of Computation 69 (2002), 1099\u20131115.","DOI":"10.1090\/S0025-5718-99-01115-1"},{"key":"9289_CR5","doi-asserted-by":"crossref","unstructured":"S. Smale, Newton\u2019s method estimates from data at one point, in The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics (R. Ewing, K. Gross, and C. Martin, eds.), Springer-Verlag, New York, 1986, pp. 185\u2013196.","DOI":"10.1007\/978-1-4612-4984-9_13"},{"key":"9289_CR6","doi-asserted-by":"crossref","unstructured":"Z. Zeng, Computing multiple roots of inexact polynomials, Math. Comp., 74 (2005), 869\u2013903.","DOI":"10.1090\/S0025-5718-04-01692-8"},{"key":"9289_CR7","doi-asserted-by":"crossref","unstructured":"P. B\u00fcrgisser and F. Cucker, Condition: The Geometry of Numerical Algorithms, Series: Grundlehren der mathematischen Wissenschaften 349, Springer, 2013.","DOI":"10.1007\/978-3-642-38896-5"},{"key":"9289_CR8","unstructured":"W. Kahan, Conserving confluence curbs ill-condition, Technical Report, Computer Science Department, University of California, Berkeley, 1972."},{"key":"9289_CR9","doi-asserted-by":"crossref","unstructured":"D.J. Bates, J.D. Hauenstein, A.J. Sommese and C.W. Wampler, Numerically Solving Polynomial Systems with Bertini, SIAM Publications, 2013.","DOI":"10.1137\/1.9781611972702"},{"key":"9289_CR10","doi-asserted-by":"crossref","unstructured":"T.Y. Li, Solving polynomial systems by the homotopy continuation method, in Handbook of Numerical Analysis Vol. XI (P.G. Ciarlet, J.L. Lions eds.), Elsevier B.V. 2003, pp. 209\u2013304.","DOI":"10.1016\/S1570-8659(02)11004-0"},{"key":"9289_CR11","doi-asserted-by":"crossref","unstructured":"R. Corless, M. Giesbrecht, M. Van Hoeij, I. Kotsireas and S. Watt, \u00a0Towards Factoring bivariate Approximate Polynomials, Proc. of ISSAC\u201901, ACM Press (2001), 85\u201392.","DOI":"10.1145\/384101.384114"},{"key":"9289_CR12","doi-asserted-by":"crossref","unstructured":"R. Corless, A. Galligo, I. Kotsireas and S. Watt, A geometric-numeric algorithm for absolute factorization of multivariate polynomials, Proc. of ISSAC\u201902, ACM Press (2002), 37\u201345.","DOI":"10.1145\/780506.780512"},{"key":"9289_CR13","doi-asserted-by":"crossref","unstructured":"A. Galligo and M. van Hoeij, Approximate bivariate factorization, a geometric viewpoint, \u00a0Proceedings of SNC\u201907, ACM Press (2007), 1\u201310.","DOI":"10.1145\/1277500.1277502"},{"key":"9289_CR14","doi-asserted-by":"crossref","unstructured":"Z. Zeng, Regularization and matrix computation in numerical polynomial algebra, in Approximate Commutative Algebra, Texts and Monographs in Symbolic Computation (L. Robbiano, and J. Abbott eds.), Springer Vienna, 2009, pp. 125\u2013162.","DOI":"10.1007\/978-3-211-99314-9_5"},{"key":"9289_CR15","doi-asserted-by":"crossref","unstructured":"T. Sasaki, M. Suzuki, M. Kolar, and M. Sasaki, Approximate factorization of multivariate polynomials and absolute irreducibility testing, Japan Journal of Industrial and Applied Mathematics, 8\u20133 (1991), 357\u2013375.","DOI":"10.1007\/BF03167142"},{"key":"9289_CR16","doi-asserted-by":"crossref","unstructured":"M. van Hoeij, Factoring polynomials and the knapsack problem, Journal of Number Theory, 95\u20132 (2002), 167\u2013189.","DOI":"10.1006\/jnth.2001.2763"},{"key":"9289_CR17","doi-asserted-by":"crossref","unstructured":"A. Lenstra, H. Lenstra, and L. Lovasz, Factoring polynomials with rational coefficients, Mathematische Annalen, 261\u20134 (1982), 515\u2013534.","DOI":"10.1007\/BF01457454"},{"key":"9289_CR18","doi-asserted-by":"crossref","unstructured":"J. von zur Gathen and E. Kaltofen, Factoring sparse multivariate polynomials, Journal of Computer and System Sciences, 31\u20132 (1985), 265\u2013287.","DOI":"10.1016\/0022-0000(85)90044-3"},{"key":"9289_CR19","doi-asserted-by":"crossref","unstructured":"E. Kaltofen, Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization, SIAM Journal on Computing, 14\u20132 (1985), 469\u2013489.","DOI":"10.1137\/0214035"},{"key":"9289_CR20","doi-asserted-by":"crossref","unstructured":"G. Lecerf, New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, Applicable Algebra in Engineering, Communication and Computing, 21\u20132 (2010), 151\u2013176.","DOI":"10.1007\/s00200-010-0121-5"},{"key":"9289_CR21","doi-asserted-by":"crossref","unstructured":"Y. Huang, H.J. Stetter, W. Wu and L. Zhi, Pseudofactors of multivariate polynomials, Proc. of ISSAC\u201900, ACM Press (2000), 161\u2013168.","DOI":"10.1145\/345542.345616"},{"key":"9289_CR22","doi-asserted-by":"crossref","unstructured":"A. Galligo and S. Watt, A numerical absolute primality test for bivariate polynomials, \u00a0Proceedings of ISSAC\u201997, ACM Press (1997), 217\u2013224.","DOI":"10.1145\/258726.258788"},{"key":"9289_CR23","doi-asserted-by":"crossref","unstructured":"E. Kaltofen and J. May, On approximate irreducibility of polynomials in several variables, \u00a0Proc. of ISSAC\u201903, ACM Press (2003), 161\u2013168.","DOI":"10.1145\/860854.860893"},{"key":"9289_CR24","doi-asserted-by":"crossref","unstructured":"T. Sasaki, Approximate multivariate polynomial factorization based on zero-sum relations, Proceedings of ISSAC 2001 ACM Press (2001), 284\u2013291.","DOI":"10.1145\/384101.384139"},{"key":"9289_CR25","doi-asserted-by":"crossref","unstructured":"S. Gao, E. Kaltofen, J. May, Z. Yang and L. Zhi, Approximate factorization of multivariate polynomials via differential equations, Proc. of ISSAC\u201904, ACM Press (2004), 167\u2013174.","DOI":"10.1145\/1005285.1005311"},{"key":"9289_CR26","doi-asserted-by":"crossref","unstructured":"A. Sommese, J. Verschelde and C. Wampler, Numerical factorization of multivariate complex polynomials, Theoret. Comput. Sci. 315 (2004), 651\u2013669.","DOI":"10.1016\/j.tcs.2004.01.011"},{"key":"9289_CR27","doi-asserted-by":"crossref","unstructured":"J. Verschelde, Algorithm 795: \u00a0PHCpack: \u00a0A general-purpose solver for polynomial systems by homotopy continuation, ACM Trans. Math. Softw. 25\u20132 (1999), 251\u2013276.","DOI":"10.1145\/317275.317286"},{"key":"9289_CR28","doi-asserted-by":"crossref","unstructured":"W. Ruppert, Reducibility of polynomials \u00a0 $$f(x,y)$$ f ( x , y ) , \u00a0J. Number Theory, 77 (1999), 62\u201370.","DOI":"10.1006\/jnth.1999.2381"},{"key":"9289_CR29","doi-asserted-by":"crossref","unstructured":"S. Gao, Factoring multivariate polynomials via partial differential equations, Mathematics of Computation, 72\u2013242 (2003), 801\u2013822.","DOI":"10.1090\/S0025-5718-02-01428-X"},{"key":"9289_CR30","doi-asserted-by":"crossref","unstructured":"E. Kaltofen, J. May, Z. Yang, and L. Zhi, Approximate factorization of multivariate polynomials using singular value decomposition, J. Symb. Comput., 43\u20135 (2008), 359\u2013376.","DOI":"10.1016\/j.jsc.2007.11.005"},{"key":"9289_CR31","doi-asserted-by":"crossref","unstructured":"G. W. Stewart, Matrix Algorithms. Volume I: Basic Decompositions, SIAM publications, 1998.","DOI":"10.1137\/1.9781611971408"},{"key":"9289_CR32","unstructured":"Z. Zeng, The Gauss\u2013Newton iteration and Tubular Neighborhood Theorem, Preprint, 2012, \u00a0 http:\/\/homepages.neiu.edu\/~zzeng\/Papers\/tnt"},{"key":"9289_CR33","doi-asserted-by":"crossref","unstructured":"Z. Zeng, ApaTools: A Maple and Matlab toolbox for approximate polynomial algebra, \u00a0Software for Algebraic Geometry, IMA Volume 148, (M. Stillman, N. Takayama and J. Verschelde, eds.) Springer, 2008, pp. 149\u2013167.","DOI":"10.1007\/978-0-387-78133-4_9"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9289-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-015-9289-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9289-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9289-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T22:35:43Z","timestamp":1692138943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-015-9289-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,19]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9289"],"URL":"https:\/\/doi.org\/10.1007\/s10208-015-9289-1","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,19]]}}}