Equivalent polyadic decompositions of matrix multiplication tensors
From MaRDI portal
Publication:2074879
DOI10.1016/j.cam.2021.113941zbMath1486.15030arXiv1902.03950OpenAlexW3217647593WikidataQ114201950 ScholiaQ114201950MaRDI QIDQ2074879
Lieven De Lathauwer, Raphaël M. Jungers, Marc Van Barel, Guillaume O. Berger, Pierre-Antoine Absil
Publication date: 11 February 2022
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.03950
Symbolic computation and algebraic computation (68W30) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Multilinear algebra, tensor calculus (15A69) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- Numerical CP decomposition of some difficult tensors
- On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
- On the optimal evaluation of a set of bilinear forms
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- On the complexity of the multiplication of matrices of small formats
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication
- Gaussian elimination is not optimal
- Improving the Numerical Stability of Fast Matrix Multiplication
- The bilinear complexity and practical algorithms for matrix multiplication
- Powers of tensors and fast matrix multiplication
- Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication
- A non-commutative algorithm for multiplying 5 × 5 matrices using one hundred multiplications
- New Fast Algorithms for Matrix Operations
- Partial and Total Matrix Multiplication
- On the Asymptotic Complexity of Matrix Multiplication
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- An algorithm for multiplying 3×3 matrices
- On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry
