A Method for Tracking Singular Paths with Application to the Numerical Irreducible Decomposition

In the numerical treatment of solution sets of polynomial systems, methods for sampling and tracking a path on a solution component are fundamental. For example, in the numerical irreducible decomposition of a solution set for a polynomial system, one first obtains a “witness point set” containing generic points on all the irreducible components and then these points are grouped via numerical exploration of the components by path tracking from these points. A numerical difficulty arises when a component has multiplicity greater than one, because then all points on the component are singular. This paper overcomes this difficulty using an embedding of the polynomial system in a family of systems such that in the neighborhood of the original system each point on a higher multiplicity solution component is approached by a cluster of nonsingular points. In the case of the numerical irreducible decomposition, this embedding can be the same embedding that one uses to generate the witness point set. In handling the case of higher multiplicities, this paper, in concert with the methods we previously proposed to decompose reduced solution components, provides a complete algorithm for the numerical irreducible decomposition. The method is applicable to tracking singular paths in other contexts as well. 2000 Mathematics Subject Classification. Primary 65H10, 14Q99; Secondary 68W30.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[15]  Grégoire Lecerf.  Une alternative aux methodes de reecriture pour la resolution des systemes algebriques , 2001 .

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

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

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

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

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

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