{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T13:30:21Z","timestamp":1776864621639,"version":"3.51.2"},"reference-count":41,"publisher":"American Mathematical Society (AMS)","issue":"273","license":[{"start":{"date-parts":[[2011,6,9]],"date-time":"2011-06-09T00:00:00Z","timestamp":1307577600000},"content-version":"am","delay-in-days":365,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>\n                    We present a new technique, based on polynomial continuation, for solving systems of\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"n\">\n                        <mml:semantics>\n                          <mml:mi>n<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">n<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    polynomials in\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper N\">\n                        <mml:semantics>\n                          <mml:mi>N<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">N<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    complex variables. The method allows equations to be introduced one-by-one or in groups, obtaining at each stage a representation of the solution set that can be extended to the next stage until finally obtaining the solution set for the entire system. At any stage where positive dimensional solution components must be found, they are sliced down to isolated points by the introduction of hyperplanes. By moving these hyperplanes, one may build up the solution set to an intermediate system in which a union of hyperplanes \u201cregenerates\u201d the intersection of the component with the variety of the polynomial (or system of polynomials) brought in at the next stage. The theory underlying the approach guarantees that homotopy paths lead to all isolated solutions, and this capability can be used to generate witness supersets for solution components at any dimension, the first step in computing an irreducible decomposition of the solution set of a system of polynomial equations. The method is illustrated on several challenging problems, where it proves advantageous over both the polyhedral homotopy method and the diagonal equation-by-equation method, formerly the two leading approaches to solving sparse polynomial systems by numerical continuation.\n                  <\/p>","DOI":"10.1090\/s0025-5718-2010-02399-3","type":"journal-article","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T11:01:54Z","timestamp":1286190114000},"page":"345-377","source":"Crossref","is-referenced-by-count":70,"title":["Regeneration homotopies for solving systems of polynomials"],"prefix":"10.1090","volume":"80","author":[{"given":"Jonathan","family":"Hauenstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Sommese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Wampler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","published-online":{"date-parts":[[2010,6,9]]},"reference":[{"issue":"5","key":"1","doi-asserted-by":"publisher","first-page":"3608","DOI":"10.1137\/08073264X","article-title":"A numerical local dimensions test for points on the solution set of a system of polynomial equations","volume":"47","author":"Bates, Daniel J.","year":"2009","journal-title":"SIAM J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-1429","issn-type":"print"},{"issue":"4","key":"2","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.jco.2006.04.003","article-title":"A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set","volume":"22","author":"Bates, Dan","year":"2006","journal-title":"J. Complexity","ISSN":"https:\/\/id.crossref.org\/issn\/0885-064X","issn-type":"print"},{"key":"3","unstructured":"D.J. Bates, J.D. Hauenstein, A.J. Sommese, and C.W. Wampler, Bertini: Software for Numerical Algebraic Geometry. Available at www.nd.edu\/\u223csommese\/bertini."},{"issue":"2","key":"4","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1137\/060658862","article-title":"Adaptive multiprecision path tracking","volume":"46","author":"Bates, Daniel J.","year":"2008","journal-title":"SIAM J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-1429","issn-type":"print"},{"key":"5","isbn-type":"print","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/conm\/496\/09717","article-title":"Stepsize control for path tracking","author":"Bates, Daniel J.","year":"2009","ISBN":"https:\/\/id.crossref.org\/isbn\/9780821847466"},{"key":"6","series-title":"De Gruyter Expositions in Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1515\/9783110871746","volume-title":"The adjunction theory of complex projective varieties","volume":"16","author":"Beltrametti, Mauro C.","year":"1995","ISBN":"https:\/\/id.crossref.org\/isbn\/3110143550"},{"key":"7","isbn-type":"print","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/1073884.1073902","article-title":"Computing the multiplicity structure in solving polynomial systems","author":"Dayton, Barry H.","year":"2005","ISBN":"https:\/\/id.crossref.org\/isbn\/1595930957"},{"key":"8","series-title":"Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge. A Series of Modern Surveys in Mathematics [Results in Mathematics and Related Areas. 3rd Series. A Series of Modern Surveys in Mathematics]","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1700-8","volume-title":"Intersection theory","volume":"2","author":"Fulton, William","year":"1998","ISBN":"https:\/\/id.crossref.org\/isbn\/354062046X","edition":"2"},{"issue":"212","key":"9","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.2307\/2153370","article-title":"A polyhedral method for solving sparse polynomial systems","volume":"64","author":"Huber, Birkett","year":"1995","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"issue":"3","key":"10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s102080010026","article-title":"Quadratic Newton iteration for systems with multiplicity","volume":"2","author":"Lecerf, G.","year":"2002","journal-title":"Found. Comput. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/1615-3375","issn-type":"print"},{"key":"11","isbn-type":"print","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1145\/1390768.1390793","article-title":"Numerical primary decomposition","author":"Leykin, Anton","year":"2008","ISBN":"https:\/\/id.crossref.org\/isbn\/9781595939043"},{"issue":"1-3","key":"12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.tcs.2006.02.018","article-title":"Newton\u2019s method with deflation for isolated singularities of polynomial systems","volume":"359","author":"Leykin, Anton","year":"2006","journal-title":"Theoret. Comput. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/0304-3975","issn-type":"print"},{"key":"13","isbn-type":"print","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-0-387-75155-9_5","article-title":"Higher-order deflation for polynomial systems with isolated singular solutions","author":"Leykin, Anton","year":"2008","ISBN":"https:\/\/id.crossref.org\/isbn\/9780387751542"},{"key":"14","unstructured":"T.-L. Lee, T.Y. Li, and C.-H. Tsai, HOM4PS-2.0, Solving Polynomial Systems by the Polyhedral Homotopy Method. Software available at www.math.msu.edu\/\u223cli."},{"key":"15","isbn-type":"print","first-page":"209","article-title":"Numerical solution of polynomial systems by homotopy continuation methods","author":"Li, T. Y.","year":"2003","ISBN":"https:\/\/id.crossref.org\/isbn\/0444512470"},{"key":"16","doi-asserted-by":"crossref","unstructured":"A.J. Lotka, Undamped oscillations derived from the laws of mass action, J. Amer. Chem. Soc. 42 (1920), pp. 1595\u20131599.","DOI":"10.1021\/ja01453a010"},{"issue":"1","key":"17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0096-3003(86)90029-9","article-title":"A transformation to avoid solutions at infinity for polynomial systems","volume":"18","author":"Morgan, Alexander P.","year":"1986","journal-title":"Appl. Math. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0096-3003","issn-type":"print"},{"issue":"2","key":"18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0096-3003(87)90063-4","article-title":"A homotopy for solving general polynomial systems that respects \ud835\udc5a-homogeneous structures","volume":"24","author":"Morgan, Alexander","year":"1987","journal-title":"Appl. Math. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0096-3003","issn-type":"print"},{"issue":"2","key":"19","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0096-3003(89)90099-4","article-title":"Coefficient-parameter polynomial continuation","volume":"29","author":"Morgan, Alexander P.","year":"1989","journal-title":"Appl. Math. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0096-3003","issn-type":"print"},{"issue":"4","key":"20","doi-asserted-by":"publisher","first-page":"1308","DOI":"10.1137\/0732061","article-title":"A product-decomposition bound for Bezout numbers","volume":"32","author":"Morgan, Alexander P.","year":"1995","journal-title":"SIAM J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-1429","issn-type":"print"},{"key":"21","series-title":"Classics in Mathematics","isbn-type":"print","volume-title":"Algebraic geometry. I","author":"Mumford, David","year":"1995","ISBN":"https:\/\/id.crossref.org\/isbn\/3540586571"},{"issue":"1","key":"22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0022-247X(87)90304-0","article-title":"Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations","volume":"123","author":"Ojika, Takeo","year":"1987","journal-title":"J. Math. Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0022-247X","issn-type":"print"},{"issue":"2","key":"23","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/0022-247X(83)90055-0","article-title":"Deflation algorithm for the multiple roots of a system of nonlinear equations","volume":"96","author":"Ojika, Takeo","year":"1983","journal-title":"J. Math. Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0022-247X","issn-type":"print"},{"key":"24","doi-asserted-by":"crossref","unstructured":"B. Roth and F. Freudenstein, Synthesis of Path-Generating Mechanisms by Numerical Methods, ASME J. Engrg. Industry, 85B(3) (1963), pp. 298\u2013306.","DOI":"10.1115\/1.3669870"},{"issue":"6","key":"25","doi-asserted-by":"publisher","first-page":"2022","DOI":"10.1137\/S0036142900372549","article-title":"Numerical decomposition of the solution sets of polynomial systems into irreducible components","volume":"38","author":"Sommese, Andrew J.","year":"2001","journal-title":"SIAM J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-1429","issn-type":"print"},{"key":"26","isbn-type":"print","first-page":"297","article-title":"Using monodromy to decompose solution sets of polynomial systems into irreducible components","author":"Sommese, A. J.","year":"2001","ISBN":"https:\/\/id.crossref.org\/isbn\/1402000049"},{"issue":"6","key":"27","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1137\/S0036142901397101","article-title":"Symmetric functions applied to decomposing solution sets of polynomial systems","volume":"40","author":"Sommese, Andrew J.","year":"2002","journal-title":"SIAM J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-1429","issn-type":"print"},{"key":"28","isbn-type":"print","first-page":"109","article-title":"Numerical irreducible decomposition using PHCpack","author":"Sommese, Andrew J.","year":"2003","ISBN":"https:\/\/id.crossref.org\/isbn\/3540002561"},{"issue":"4","key":"29","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.1137\/S0036142903430463","article-title":"Homotopies for intersecting solution components of polynomial systems","volume":"42","author":"Sommese, Andrew J.","year":"2004","journal-title":"SIAM J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-1429","issn-type":"print"},{"issue":"4","key":"30","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.jco.2004.09.007","article-title":"An intrinsic homotopy for intersecting algebraic varieties","volume":"21","author":"Sommese, Andrew J.","year":"2005","journal-title":"J. Complexity","ISSN":"https:\/\/id.crossref.org\/issn\/0885-064X","issn-type":"print"},{"key":"31","isbn-type":"print","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-0-387-75155-9_8","article-title":"Solving polynomial systems equation by equation","author":"Sommese, Andrew J.","year":"2008","ISBN":"https:\/\/id.crossref.org\/isbn\/9780387751542"},{"key":"32","isbn-type":"print","first-page":"749","article-title":"Numerical algebraic geometry","author":"Sommese, Andrew J.","year":"1996","ISBN":"https:\/\/id.crossref.org\/isbn\/0821805304"},{"key":"33","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1142\/9789812567727","volume-title":"The numerical solution of systems of polynomials","author":"Sommese, Andrew J.","year":"2005","ISBN":"https:\/\/id.crossref.org\/isbn\/9812561846"},{"key":"34","doi-asserted-by":"crossref","unstructured":"J. Verschelde, Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation, ACM Trans. Math. Software 25(2) (1999), pp. 251\u2013276. Software available at www.math.uic.edu\/\u223cjan.","DOI":"10.1145\/317275.317286"},{"issue":"3","key":"35","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF01202036","article-title":"Symbolic homotopy construction","volume":"4","author":"Verschelde, Jan","year":"1993","journal-title":"Appl. Algebra Engrg. Comm. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0938-1279","issn-type":"print"},{"issue":"3","key":"36","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1137\/0731049","article-title":"Homotopies exploiting Newton polytopes for solving sparse polynomial systems","volume":"31","author":"Verschelde, Jan","year":"1994","journal-title":"SIAM J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-1429","issn-type":"print"},{"key":"37","unstructured":"V. Volterra, Variazionie fluttuazioni del numero d\u2019individui in specie animali convivent, Mem. Acad. Lincei., 2 (1926), pp. 31\u2013113."},{"key":"38","isbn-type":"print","first-page":"57","article-title":"Solving the kinematics of general 6R manipulators using polynomial continuation","author":"Wampler, C. W.","year":"1993","ISBN":"https:\/\/id.crossref.org\/isbn\/0198536496"},{"key":"39","doi-asserted-by":"crossref","unstructured":"C.W. Wampler, A. Morgan, and A.J. Sommese, Complete solution of the nine-point path synthesis problem for four-bar linkages, ASME J. Mech. Des. 114(1) (1992), pp. 153\u2013159.","DOI":"10.1115\/1.2916909"},{"issue":"3","key":"40","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1137\/070681740","article-title":"A hybrid polynomial system solving method for mixed trigonometric polynomial systems","volume":"46","author":"Yu, Bo","year":"2008","journal-title":"SIAM J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-1429","issn-type":"print"},{"key":"41","isbn-type":"print","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1090\/conm\/496\/09733","article-title":"The closedness subspace method for computing the multiplicity structure of a polynomial system","author":"Zeng, Zhonggang","year":"2009","ISBN":"https:\/\/id.crossref.org\/isbn\/9780821847466"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/2011-80-273\/S0025-5718-2010-02399-3\/S0025-5718-2010-02399-3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/2011-80-273\/S0025-5718-2010-02399-3\/S0025-5718-2010-02399-3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T16:41:20Z","timestamp":1776789680000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2011-80-273\/S0025-5718-2010-02399-3\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,9]]},"references-count":41,"journal-issue":{"issue":"273","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["S0025-5718-2010-02399-3"],"URL":"https:\/\/doi.org\/10.1090\/s0025-5718-2010-02399-3","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2010,6,9]]}}}