Numerical CP decomposition of some difficult tensors

DOI10.1016/j.cam.2016.12.007zbMath1357.65050arXiv1603.01372OpenAlexW2963931908MaRDI QIDQ508007

Andrzej Cichocki, Anh-Huy Phan, Petr Tichavský

Publication date: 9 February 2017

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

algorithmLevenberg-Marquardt methodnumerical resultcanonical polyadic tensor decompositionsmall matrix multiplication

Mathematics Subject Classification ID

Related Items (2)

Equivalent polyadic decompositions of matrix multiplication tensors ⋮ Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition

Uses Software

• fminsearch

Cites Work

• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Optimization techniques for small matrix multiplication
• Gaussian elimination is not optimal
• On multiplication of 2 \(\times\) 2 matrices
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC
• Enhanced Line Search: A Novel Method to Accelerate PARAFAC
• Multiplying matrices faster than coppersmith-winograd

This page was built for publication: Numerical CP decomposition of some difficult tensors