Search CurateND

Search criteria:

Clear all

List of files deposited in CurateND that match your search criteria

  • Creator(s):
    Jonathan Hauenstein
    Description:

    A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness sets via numerical elimination theory, we develop computational methods for computing ranks and border ranks of tensors along with decompositions. More generally, we present our approach using joins of any collection of irreducible and nondegenerate projecti…

    Date Created:
    2016-08-31
    Record Visibility:
    Public