11 citations · 29 across the 10 of their papers we have counts for
3 papers · 1 filter
How well-conditioned can the eigenvalue problem be?
Carlos Beltrán, Laurent Bétermin, Peter Grabner +1
The condition number for eigenvalue computations is a well--studied quantity. But how small can we expect it to be? Namely, which is a perfectly conditioned matrix w.r.t. eigenvalu…
The average condition number of most tensor rank decomposition problems is infinite
Carlos Beltrán, Paul Breiding, Nick Vannieuwenhoven
The tensor rank decomposition, or canonical polyadic decomposition, is the decomposition of a tensor into a sum of rank-1 tensors. The condition number of the tensor rank decomposi…
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.