Numerical CP decomposition of some difficult tensors

DOI10.1016/J.CAM.2016.12.007MaRDI QIDQ508007zbMATH OpenOpenAlexFDO

Authors Petr Tichavský, Anh-Huy Phan, Andrzej Cichocki

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

algorithmnumerical resultLevenberg-Marquardt methodcanonical polyadic tensor decompositionsmall matrix multiplication

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69)

Abstract: In this paper, a numerical method is proposed for canonical polyadic (CP) decomposition of small size tensors. The focus is primarily on decomposition of tensors that correspond to small matrix multiplications. Here, rank of the tensors is equal to the smallest number of scalar multiplications that are necessary to accomplish the matrix multiplication. The proposed method is based on a constrained Levenberg-Marquardt optimization. Numerical results indicate the rank and border ranks of tensors that correspond to multiplication of matrices of the size 2x3 and 3x2, 3x3 and 3x2, 3x3 and 3x3, and 3x4 and 4x3. The ranks are 11, 15, 23 and 29, respectively. In particular, a novel algorithm for multiplying the matrices of the sizes 3x3 and 3x2 with 15 multiplications is presented.

Recommendations

• A Practical Randomized CP Tensor Decomposition
• Numerical optimization for symmetric tensor decomposition
• Tensor decompositions for the bubbles and cube numerical framework
• Numerical tensor techniques for multidimensional convolution products
• scientific article; zbMATH DE number 1225903
• Decomposition Algorithms for Tensors and Polynomials
• Computing tensor product decompositions
• Tensor Decompositions and Applications
• Tensor numerical methods in scientific computing
• Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations

Cites work

• scientific article; zbMATH DE number 4018239 (Why is no real title available?)
• scientific article; zbMATH DE number 5968745 (Why is no real title available?)
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
• Enhanced Line Search: A Novel Method to Accelerate PARAFAC
• Gaussian elimination is not optimal
• Low complexity damped Gauss-Newton algorithms for CANDECOMP/PARAFAC
• Multiplying matrices faster than coppersmith-winograd
• On multiplication of 2 2 matrices
• Optimization techniques for small matrix multiplication
• Tensor Decompositions and Applications

Cited in

(5)

• Equivalent polyadic decompositions of matrix multiplication tensors
• Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition
• A Practical Randomized CP Tensor Decomposition
• scientific article; zbMATH DE number 6672348 (Why is no real title available?)
• CP decomposition and weighted clique problem

Describes a project that uses

Uses Software

• fminsearch

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q508007)