Regeneration, local dimension, and applications in numerical algebraic geometry

In a 1996 paper, Andrew Sommese and Charles Wampler began developing a new area, “Numerical Algebraic Geometry”, which would bear the same relation to “Algebraic Geometry” that “Numerical Linear Algebra” bears to “Linear Algebra”.

[1]  Charles W. Wampler,et al.  A product-decomposition bound for Bezout numbers , 1995 .

[2]  Mengnien Wu,et al.  Numerical Schubert Calculus by the Pieri Homotopy Algorithm , 2002, SIAM J. Numer. Anal..

[3]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[4]  Uffe Haagerup,et al.  Orthogonal Maximal Abelian *-Subalgebras of the N×n Matrices and Cyclic N-Roots , 1995 .

[5]  C. B. García,et al.  On the Number of Solutions to Polynomial Systems of Equations , 1980 .

[6]  Anton Leykin,et al.  Newton's method with deflation for isolated singularities of polynomial systems , 2006, Theor. Comput. Sci..

[7]  Andrew J. Sommese,et al.  Numerical Irreducible Decomposition Using PHCpack , 2003, Algebra, Geometry, and Software Systems.

[8]  Sunyoung Kim,et al.  Numerical Stability of Path Tracing in Polyhedral Homotopy Continuation Methods , 2004, Computing.

[9]  Tien-Yien Li,et al.  Mixed Volume Computation for Semi-Mixed Systems , 2003, Discret. Comput. Geom..

[10]  M. Kojima,et al.  Computing all nonsingular solutions of cyclic- n polynomial using polyhedral homotopy continuation methods , 2003 .

[11]  Eugene L. Allgower,et al.  Continuation and path following , 1993, Acta Numerica.

[12]  Bernd Sturmfels.  On the number of real roots of a sparse polynomial system , 1994 .

[13]  L. Watson.  Numerical linear algebra aspects of globally convergent homotopy methods , 1986 .

[14]  Layne T. Watson,et al.  The Parallel Complexity of Embedding Algorithms for the Solution of Systems of Nonlinear Equations , 1993, IEEE Trans. Parallel Distributed Syst..

[15]  Eugenii Shustin,et al.  Viro theorem and topology of real and complex combinatorial hypersurfaces , 2001, math/0105198.

[16]  André Galligo,et al.  Semi-numerical determination of irreducible branches of a reduced space curve , 2001, ISSAC '01.

[17]  Frank Sottile,et al.  Enumerative Real Algebraic Geometry , 2001, Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science.

[18]  M. S. Ravi,et al.  Degree of the generalized Plücker embedding of a quot scheme and quantum cohomology , 1998 .

[19]  J. Yorke,et al.  The cheater's homotopy: an efficient procedure for solving systems of polynomial equations , 1989 .

[20]  Akiko Takeda,et al.  PHoM – a Polyhedral Homotopy Continuation Method for Polynomial Systems , 2004, Computing.

[21]  Andrew J. Sommese,et al.  Numerical Homotopies to Compute Generic Points on Positive Dimensional Algebraic Sets , 2000, J. Complex..

[22]  Eecient Incremental Algorithms for the Sparse Resultant and the Mixed Volume , 1995 .

[23]  J. Verschelde,et al.  Numerical Homotopy Algorithms for Satellite Trajectory Control by Pole Placement 1 , 2002 .

[24]  Xiaoshen Wang,et al.  THE BKK ROOT COUNT IN C , 1996 .

[25]  Xiaoshen Wang,et al.  Solving deficient polynomial systems with homotopies which keep the subschemes at infinity invariant , 1991 .

[26]  J. Maurice Rojas,et al.  An optimal condition for determining the exact number of roots of a polynomial system , 1991, ISSAC '91.

[27]  Tien-Yien Li.  Solving polynomial systems , 1987 .

[28]  A. Morgan,et al.  Complete Solution of the Nine-Point Path Synthesis Problem for Four-Bar Linkages , 1992 .

[29]  Gene H. Golub,et al.  Matrix computations , 1983 .

[30]  R. J. Walker.  Algebraic curves , 1950 .

[31]  Ronald Cools,et al.  Symmetric homotopy construction , 1994 .

[32]  M. Raghavan.  The Stewart platform of general geometry has 40 configurations , 1993 .

[33]  Stephen M. Watt,et al.  A geometric-numeric algorithm for absolute factorization of multivariate polynomials , 2002, ISSAC '02.

[34]  D. N. Bernshtein.  The number of roots of a system of equations , 1975 .

[35]  Bertrand Haas.  A Simple Counterexample to Kouchnirenko ’ s Conjecture , 2002 .

[36]  Xiaoshen Wang,et al.  The BKK root count in Cn , 1996, Math. Comput..

[37]  Stephen M. Watt,et al.  Towards factoring bivariate approximate polynomials , 2001, ISSAC '01.

[38]  Sosonkina Maria,et al.  HOMPACK90: A Suite of FORTRAN 90 Codes for Globally Convergent Homotopy Algorithms , 1996 .

[39]  W. Zulehner.  A simple homotopy method for determining all isolated solutions to polynomial systems , 1988 .

[40]  A. Morgan,et al.  Computing singular solutions to polynomial systems , 1992 .

[41]  David A. Cox,et al.  Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics) , 2007 .

[42]  Jan Verschelde,et al.  A Method for Tracking Singular Paths with Application to the Numerical Irreducible Decomposition , 2002 .

[43]  Andrew J. Sommese,et al.  Homotopies for Intersecting Solution Components of Polynomial Systems , 2004, SIAM J. Numer. Anal..

[44]  Bernd Sturmfels,et al.  Bernstein’s theorem in affine space , 1997, Discret. Comput. Geom..

[45]  Eugene L. Allgower,et al.  Numerical continuation methods - an introduction , 1990, Springer series in computational mathematics.

[46]  Carl W. Lee,et al.  Regular Triangulations of Convex Polvtopes , 1990, Applied Geometry And Discrete Mathematics.

[47]  Lihong Zhi,et al.  Pseudofactors of multivariate polynomials , 2000, ISSAC.

[48]  J. Verschelde,et al.  Homotopies exploiting Newton polytopes for solving sparse polynomial systems , 1994 .

[49]  F. Drexler.  Eine Methode zur berechnung sämtlicher Lösungen von Polynomgleichungssystemen , 1977 .

[50]  Jan Verschelde,et al.  Toric Newton Method for Polynomial Homotopies , 2000, J. Symb. Comput..

[51]  Yan Zhuang,et al.  Parallel implementation of the polyhedral homotopy method , 2006, 2006 International Conference on Parallel Processing Workshops (ICPPW'06).

[52]  Erich Kaltofen,et al.  Challenges of Symbolic Computation: My Favorite Open Problems , 2000, J. Symb. Comput..

[53]  J. Faugère.  A new efficient algorithm for computing Gröbner bases (F4) , 1999 .

[54]  Reinhard C. Laubenbacher,et al.  Permanental Ideals , 2000, J. Symb. Comput..

[55]  A. J. Lotka.  UNDAMPED OSCILLATIONS DERIVED FROM THE LAW OF MASS ACTION. , 1920 .

[56]  Bernd Sturmfels,et al.  A polyhedral method for solving sparse polynomial systems , 1995 .

[57]  Tien-Yien Li.  Numerical Solution of Polynomial Systems by Homotopy Continuation Methods , 2003 .

[58]  M.L. Husty,et al.  Self-motions of Griffis-Duffy type parallel manipulators , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[59]  John F. Canny,et al.  Factoring Rational Polynomials Over the Complex Numbers , 1993, SIAM J. Comput..

[60]  Felice Ronga,et al.  Stewart platforms without computer , 1995 .

[61]  Steven M. Wise,et al.  Algorithm 801: POLSYS_PLP: a partitioned linear product homotopy code for solving polynomial systems of equations , 2000, TOMS.

[62]  Martin E. Dyer,et al.  On the Complexity of Computing the Volume of a Polyhedron , 1988, SIAM J. Comput..

[63]  S. Smale,et al.  The mathematics of numerical analysis : 1995 AMS-SIAM Summer Seminar in Applied Mathematics, July 17-August 11, 1995, Park City, Utah , 1996 .

[64]  W. Fulton,et al.  Algebraic Curves: An Introduction to Algebraic Geometry , 1969 .

[65]  Alexander P. Morgan,et al.  A Method for Computing All Solutions to Systems of Polynomials Equations , 1983, TOMS.

[66]  Andrew J. Sommese.  Numerical Irreducible Decomposition using Projections from Points on the Components , 2001 .

[67]  Tien Yien Li,et al.  Regularity results for solving systems of polynomials by homotopy method , 1986 .

[68]  Jan Verschelde,et al.  Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation , 1999, TOMS.

[69]  H. Peitgen,et al.  Functional Differential Equations and Approximation of Fixed Points , 1979 .

[70]  Ronald Cools,et al.  Symbolic homotopy construction , 2005, Applicable Algebra in Engineering, Communication and Computing.

[71]  Andrew J. Sommese,et al.  Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components , 2000, SIAM J. Numer. Anal..

[72]  Tien-Yien Li,et al.  Nonlinear homotopies for solving deficient polynomial systems with parameters , 1992 .

[73]  Charles W. Wampler.  FORWARD DISPLACEMENT ANALYSIS OF GENERAL SIX-IN-PARALLEL SPS (STEWART) PLATFORM MANIPULATORS USING SOMA COORDINATES , 1996 .

[74]  Frank Sottile,et al.  A sagbi basis for the quantum Grassmannian , 1999 .

[75]  J. Verschelde,et al.  The GBQ -algorithm for constructing start systems of homotopies for polynomial systems , 1993 .

[76]  Birkett Huber,et al.  The Cayley Trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings , 2000 .

[77]  L. T. Watson,et al.  Globally convergent homotopy methods: a tutorial , 1989, Conference on Numerical Ordinary Differential Equations.

[78]  A. G. Kushnirenko,et al.  Newton polytopes and the Bezout theorem , 1976 .

[79]  Xing Li,et al.  Finding Mixed Cells in the Mixed Volume Computation , 2001, Found. Comput. Math..

[80]  Andrew J. Sommese,et al.  Numerical factorization of multivariate complex polynomials , 2004, Theor. Comput. Sci..

[81]  Jan Verschelde,et al.  Using Monodromy to Decompose Solution Sets of Polynomial Systems into Irreducible Components , 2001 .

[82]  J. Maurice Rojas,et al.  A Convex Geometric Approach to Counting the Roots of a Polynomial System , 1994, Theor. Comput. Sci..

[83]  Jan Verschelde,et al.  Advances in Polynomial Continuation for Solving Problems in Kinematics , 2004 .

[84]  Bernard Deconinck,et al.  Computing Riemann matrices of algebraic curves , 2001 .

[85]  Joachim Rosenthal,et al.  Open problems in the area of pole placement , 1999 .

[86]  T. Willmore.  Algebraic Geometry , 1973, Nature.

[87]  Frank Sottile,et al.  Pieri’S Formula Via Explicit Rational Equivalence , 1996, Canadian Journal of Mathematics.

[88]  Charles W. Wampler.  Bezout number calculations for multi-homogeneous polynomial systems , 1992 .

[89]  E. Allgower,et al.  Numerical path following , 1997 .

[90]  A. Morgan,et al.  Coefficient-parameter polynomial continuation , 1989 .

[91]  J. Yorke,et al.  Numerical solution of a class of deficient polynomial systems , 1987 .

[92]  Chris Smith,et al.  Geometric completion of differential systems using numeric-symbolic continuation , 2002, SIGS.

[93]  Tateaki Sasaki,et al.  Approximate multivariate polynomial factorization based on zero-sum relations , 2001, ISSAC '01.

[94]  J. Rosenthal.  On Dynamic Feedback Compensation and Compactification of Systems , 1994 .

[95]  Ioannis Z. Emiris,et al.  How to Count Efficiently all Affine Roots of a Polynomial System , 1999, Discret. Appl. Math..

[96]  Ronald Cools,et al.  Mixed-volume computation by dynamic lifting applied to polynomial system solving , 1996, Discret. Comput. Geom..

[97]  Layne T. Watson.  Probability-one homotopies in computational science , 2002 .

[98]  F. S. Macaulay,et al.  The Algebraic Theory of Modular Systems , 1972 .

[99]  Layne T. Watson,et al.  Algorithm 652: HOMPACK: a suite of codes for globally convergent homotopy algorithms , 1987, TOMS.

[100]  Stephen M. Watt,et al.  A geometric-numeric algorithm for factoring multivariate polynomials , 2002, International Symposium on Symbolic and Algebraic Computation.

[101]  J. Verschelde.  Polynomial Homotopies for Dense, Sparse and Determinantal Systems , 1999, math/9907060.

[102]  J. Yorke,et al.  A homotopy method for locating all zeros of a system of polynomials , 1979 .

[103]  A. Morgan,et al.  A homotopy for solving general polynomial systems that respects m-homogeneous structures , 1987 .

[104]  Akiko Takeda,et al.  ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD , 2002 .

[105]  Jan Verschelde,et al.  Polyhedral end games for polynomial continuation , 2004, Numerical Algorithms.

[106]  André Galligo,et al.  Irreducible Decomposition of Curves , 2002, J. Symb. Comput..

[107]  Bernard Mourrain,et al.  The 40 “generic” positions of a parallel robot , 1993, ISSAC '93.

[108]  A. Morgan,et al.  Numerical Continuation Methods for Solving Polynomial Systems Arising in Kinematics , 1990 .

[109]  Hans J. Stetter.  Analysis of zero clusters in multivariate polynomial systems , 1996, ISSAC '96.

[110]  J. McDonald.  Fractional Power Series Solutions for Systems of Equations , 2002, Discret. Comput. Geom..

[111]  Frank Sottile.  Enumerative geometry for real varieties , 1996 .

[112]  Jan Verschelde,et al.  Pieri Homotopies for Problems in Enumerative Geometry Applied to Pole Placement in Linear Systems Control , 2000, SIAM J. Control. Optim..

[113]  George A. Kirkup.  Minimal primes over permanental ideals , 2005, math/0510025.

[114]  Masha Sosonkina,et al.  Note on the end game in homotopy zero curve tracking , 1996, TOMS.

[115]  R. B. Kearfott,et al.  An Interval Step Control for Continuation Methods , 1994 .

[116]  C. B. García,et al.  Finding all solutions to polynomial systems and other systems of equations , 1979, Math. Program..

[117]  BERND STURMFELS,et al.  Numerical Schubert Calculus , 1998, J. Symb. Comput..

[118]  Bernd Sturmfels.  Viro's theorem for complete intersections , 1994 .

[119]  A. Wright.  Finding all solutions to a system of polynomial equations , 1985 .

[120]  A. Morgan.  Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems , 1987 .

[121]  M. Husty.  An algorithm for solving the direct kinematics of general Stewart-Gough platforms , 1996 .

[122]  T. Rajagopalan,et al.  Pole assignment with output feedback , 1984, Autom..

[123]  Bernd Sturmfels,et al.  Lattice Walks and Primary Decomposition , 1998 .

[124]  Tien Yien Li,et al.  MIXED VOLUME COMPUTATION VIA LINEAR PROGRAMMING , 2000 .

[125]  Hans J. Stetter,et al.  Numerical polynomial algebra , 2004 .

[126]  Serkan Hosten,et al.  Primary Decomposition of Lattice Basis Ideals , 2000, J. Symb. Comput..

[127]  J. Verschelde,et al.  Symmetrical Newton Polytopes for Solving Sparse Polynomial Systems , 1995 .

[128]  Andrew J. Sommese,et al.  The numerical solution of systems of polynomials - arising in engineering and science , 2005 .

[129]  Joe W. Harris,et al.  Principles of Algebraic Geometry , 1978 .

[130]  Bernd Sturmfels,et al.  On the Newton Polytope of the Resultant , 1994 .

[131]  J. Maurice Rojas,et al.  Toric intersection theory for affine root counting , 1996, math/9606215.

[132]  Mauro C. Beltrametti,et al.  A method for tracking singular paths with application to the numerical irreducible decomposition , 2002 .

[133]  A. Morgan,et al.  A power series method for computing singular solutions to nonlinear analytic systems , 1992 .

[134]  James A. Yorke,et al.  The random product homotopy and deficient polynomial systems , 1987 .

[135]  A. Morgan.  A transformation to avoid solutions at infinity for polynomial systems , 1986 .

[136]  C. Hoffmann.  Algebraic curves , 1988 .

[137]  Robert M. Corless,et al.  Graphing elementary Riemann surfaces , 1998, SIGS.

[138]  A. Morgan,et al.  Computing singular solutions to nonlinear analytic systems , 1990 .

[139]  Chris Peterson,et al.  A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set , 2006, J. Complex..

[140]  Martin E. Dyer,et al.  On the Complexity of Computing Mixed Volumes , 1998, SIAM J. Comput..

[141]  Grégoire Lecerf.  Quadratic Newton Iteration for Systems with Multiplicity , 2002, Found. Comput. Math..

[142]  A. Khovanskii.  Newton polyhedra and the genus of complete intersections , 1978 .

[143]  Zhonggang Zeng,et al.  Computing the multiplicity structure in solving polynomial systems , 2005, ISSAC.

[144]  Seth Sullivant,et al.  Ideals of adjacent minors , 2003 .

[145]  Layne T. Watson,et al.  The Granularity of Homotopy Algorithms for Polynomial Systems of Equations , 1987, SIAM Conference on Parallel Processing for Scientific Computing.

[146]  T. Ojika,et al.  Deflation algorithm for the multiple roots of a system of nonlinear equations , 1983 .

[147]  A. Morgan,et al.  Errata: Computing all solutions to polynomial systems using homotopy continuation , 1987 .

[148]  Andrew J. Sommese,et al.  Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems , 2002, SIAM J. Numer. Anal..

[149]  Takeo Ojika,et al.  Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations , 1987 .