79 citations · 407 across the 53 of their papers we have counts for
3 papers · 1 filter
Complexity of linear circuits and geometry
Fulvio Gesmundo, Jonathan Hauenstein, Christian Ikenmeyer +1
We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) e…
Equations for lower bounds on border rank
Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg
We present new methods for determining polynomials in the ideal of the variety of bilinear maps of border rank at most r. We apply these methods to several cases including the case…
Certifying the Potential Energy Landscape
Dhagash Mehta, Jonathan D. Hauenstein, David J. Wales
It is highly desirable for a numerical approximation of a stationary point for a potential energy landscape to lie in the quadratic convergence basin of that stationary point. Howe…