Macaulay2 » Documentation
Packages » EuclideanDistanceDegree » numericWeightEDDegree
next | previous | forward | backward | up | index | toc

numericWeightEDDegree -- numerically compute ED degrees of affine cones using homotopy continuation

Description

Special instances of the homotopyEDDegree method that uses a homotopy on weights. The unit variant of this method computes an ED degree using random (complex) data and unit weights, whereas `numericGenericEDDegree` will use random data and random weights.

i1 : R = QQ[x,y];
i2 : F = G = {x^2+y^2-1};
i3 : (U,W) = ({.12, .23}, {.15, .331});
i4 : UED = numericUnitEDDegree(F, G)

o4 = 2
i5 : GED = numericGenericEDDegree(F, G)
-- warning: experimental computation over inexact field begun
--          results not reliable (one warning given per session)

o5 = 4
i6 : GED = numericWeightEDDegree(F, G, U, W)

o6 = 4

Caveat

Inaccurate results may be returned if $V(F)$ is contained in $V(L)$. The computed ED degree may be lower than expected due to path tracking.

Menu

Ways to use numericWeightEDDegree:

  • numericWeightEDDegree(List,List,List,List)

For the programmer

The object numericWeightEDDegree is a method function with options.


The source of this document is in /build/reproducible-path/macaulay2-1.26.06+ds/M2/Macaulay2/packages/EuclideanDistanceDegree.m2:491:0.