A fundamental problem in algebraic geometry is to decompose the solution set of a given polynomial system. A numerical description of this solution set is called a numerical irreducible decomposition and currently all standard algorithms use a sequence of homotopies forming a dimension-by-dimension approach. In this article, we pair a classical result to compute a smooth point on every irreducible component in every dimension using a single homotopy together with the theory of isosingular sets. Examples are presented to compare this approach with current algorithms for computing a numerical irreducible decomposition.
Excess intersections and numerical irreducible decompositionsDataset
|Departments and Units|
|Record Visibility and Access||Public|
Digital Object Identifier
This DOI is the best way to cite this dataset.