Algorithm for low-rank decomposition of partially symmetric tensors via flattening orthogonalization and shifted power method with global convergence proof.
Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics.Linear algebra and its applications, 18(2):95–138, 1977
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multi-subspace power method for decomposing partially symmetric tensors
Algorithm for low-rank decomposition of partially symmetric tensors via flattening orthogonalization and shifted power method with global convergence proof.