A recursive algorithm using linear solves and singular vectors computes unique rank-one completions for rank one determinable tensors, remaining stable under small noise.
Steinlechner,Riemannian optimization for high-dimensional tensor completion, SIAM J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Rank One Completion for Higher Order Tensors
A recursive algorithm using linear solves and singular vectors computes unique rank-one completions for rank one determinable tensors, remaining stable under small noise.