Search CurateND

Search criteria:

Department or Unit: Applied and Computational Mathematics and Statistics remove × Department or Unit: College of Science remove ×
Clear all

List of files deposited in CurateND that match your search criteria

  • Creator(s):
    Dan Bates, David Eklund, Jonathan Hauenstein, Chris Peterson

    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:
    Record Visibility: