Complete decomposition of symmetric tensors in linear time and polylogarithmic precision

DOI10.1007/978-3-031-30448-4_22arXiv2211.07407MaRDI QIDQ6057345

Subhayan Saha, Pascal Koiran

Publication date: 4 October 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.07407

zbMATH Keywords

tensor decompositionfinite precision arithmeticcomputational linear algebraJennrich's algorithm

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Symmetric tensor decomposition
• Computing symmetric rank for symmetric tensors
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
• A Decomposition for Three-Way Arrays
• Algorithmic Aspects of Machine Learning
• Accuracy and Stability of Numerical Algorithms
• A PSPACE construction of a hitting set for the closure of small algebraic circuits
• Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable
• Fourier PCA and robust tensor decomposition
• Smoothed analysis of tensor decompositions
• Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits

This page was built for publication: Complete decomposition of symmetric tensors in linear time and polylogarithmic precision