College of Science

Search criteria:

List of files deposited in CurateND that match your search criteria

• 1

  Dataset

  Excess intersections and numerical irreducible decompositions
  

  Creator(s):

  Dan Bates, David Eklund, Jonathan Hauenstein, Chris Peterson

  Description:

  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 s…

  Date Created:

  2019-04-26

  Record Visibility:

  Public