A two-sided sketching algorithm with subspace iteration for low-rank tensor train approximation, including error bounds and numerical tests on synthetic and real data.
Title resolution pending
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
-
A Two-Sided Sketching Algorithm for Low-rank Tensor Train Approximation
A two-sided sketching algorithm with subspace iteration for low-rank tensor train approximation, including error bounds and numerical tests on synthetic and real data.