Homotopies for Intersecting Solution Components of Polynomial Systems

We show how to use numerical continuation to compute the intersection $C=A\cap B$ of two algebraic sets A and B, where A, B, and C are numerically represented by witness sets. En route to this result, we first show how to find the irreducible decomposition of a system of polynomials restricted to an algebraic set. The intersection of components A and B then follows by considering the decomposition of the diagonal system of equations u - v = 0 restricted to {u,v}$\in$ A $\times$ B. An offshoot of this new approach is that one can solve a large system of equations by finding the solution components of its subsystems and then intersecting these. It also allows one to find the intersection of two components of the two polynomial systems, which is not possible with any previous numerical continuation approach.

[1]  E. Allgower,et al.  Numerical Continuation Methods , 1990 .

[2]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[3]  D. Mumford.  Algebraic Geometry I: Complex Projective Varieties , 1981 .

[4]  D. Eisenbud.  Commutative Algebra: with a View Toward Algebraic Geometry , 1995 .

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

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

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

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

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

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

[11]  E. Allgower,et al.  Introduction to Numerical Continuation Methods , 1987 .

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

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

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

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

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

[17]  Mauro C. Beltrametti,et al.  The Adjunction Theory of Complex Projective Varieties , 1995 .

[18]  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).