86 citations · 188 across the 17 of their papers we have counts for
Showing 2015 · math.NAShow all
2 papers · 2 filters
math.NA2015
Condition length and complexity for the solution of polynomial systems
Diego Armentano, Carlos Beltrán, Peter Bürgisser +2
Smale's 17th problem asks for an algorithm which finds an approximate zero of polynomial systems in average polynomial time (see Smale 2000). The main progress on Smale's problem i…
math.NA2015
A stable, polynomial-time algorithm for the eigenpair problem
Diego Armentano, Carlos Beltrán, Peter Bürgisser +2
We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex matrix . These algorithms are numerically stable, strongly accurate, and…