Macaulay2
»
Documentation
Packages
»
EuclideanDistanceDegree
::
Table of Contents
next | previous | forward | backward | up |
index
|
toc
EuclideanDistanceDegree : Table of Contents
EuclideanDistanceDegree
-- produce critical equations and compute ED degrees
symbolicWeightEDDegree
-- symbolically compute ED degrees of affine varieties
ReturnCriticalIdeal
-- whether to return the ideal of critical points
leftKernelWeightEDDegree
-- numerically compute Euclidean distance degrees of complete intersections
TempDirectory
-- set directory for Bertini runs
numericWeightEDDegree
-- numerically compute ED degrees of affine cones using homotopy continuation
homotopyEDDegree
-- numerically compute ED degrees of affine cones using homotopy continuation
NumericalComputationOptions
-- define homotopy options and configurations
newNumericalComputationOptions
-- define homotopy options and configurations
Submodel
(missing documentation)
parameterizedWeightEDDegree
-- compute ED degrees of parameterized varieties
UseMonodromy
-- whether to use monodromy methods to compute degrees
averageNumericEDDegree
-- compute average ED degrees using sampled data
SampleGenerator
(missing documentation)