activity
20082023
most citedRandom systems of polynomial equations. The expected number of roots under smooth analysis

10 citations · 23 across the 11 of their papers we have counts for

collaborators
Showing 2014Show all

1 paper · 1 filter

math.NA2014★ 2 cited

Average polynomial time for eigenvector computations

Diego Armentano, Carlos Beltrán, Michael Shub

We describe two algorithms for the eigenvalue, eigenvector problem which, on input a Gaussian matrix with complex entries, finish with probability 1 and in average polynomial time.