47 citations · 232 across the 39 of their papers we have counts for
Showing 2018 · math.NAShow all
2 papers · 2 filters
math.NA2018★ 22 cited
Pencil-based algorithms for tensor rank decomposition are not stable
Carlos Beltrán, Paul Breiding, Nick Vannieuwenhoven
We prove the existence of an open set of tensors of rank on which a popular and efficient class of algorithms for computing tensor rank decomposition…
math.NA2018★ 3 cited
On the average condition number of tensor rank decompositions
Paul Breiding, Nick Vannieuwenhoven
We compute the expected value of powers of the geometric condition number of random tensor rank decompositions. It is shown in particular that the expected value of the condition n…