solsT = track(S,T,solsS)
H(t) = \gamma t^d T + (1-t)^d S
where S and T are square systems (number of equations = number of variables) of polynomials over CC, t is in the interval [0,1] and d = tDegree.Here is an example with regular solutions at the ends of all homotopy paths:
|
|
|
|
|
Another outcome of tracking a path is divergence (established heuristically). In that case the divergent paths are marked with an I (status is set to Infinity).
|
|
|
|
|
Some divergent paths as well as most of the paths ending in singular (multiplicity>1) or near-singular (clustered) solutions are marked with an M (status is set to MinStepFailure).
|
|
|
|
|
Tracking in the projective space uses the homotopy corresponding to an arc of a great circle on a unit sphere in the space of homogeneous polynomial systems of a fixed degree. In particular, this is done for certified homotopy tracking (see C. Beltran and A. Leykin, "Certified numerical homotopy tracking", Experimental Mathematics 21(1): 69-83 (2012)):
|
|
|
|
|
Note that the projective tracker is invoked either if the target system is a homogeneous system or if Projectivize=>true is specified.
Unspecified optional arguments (with default values null) have their actual values taken from a local hashtable of defaults controlled by the functions getDefault and setDefault.