The tensor rank of 5x5 matrices multiplication is bounded by 98 and its border rank by 89

01/29/2021
by   Alexandre Sedoglavic, et al.
0

We present a non-commutative algorithm for the product of 3x5 by 5x5 matrices using 58 multiplications. This algorithm allows to construct a non-commutative algorithm for multiplying 5x5 (resp. 10x10, 15x15) matrices using 98 (resp. 686, 2088) multiplications. Furthermore, we describe an approximate algorithm that requires 89 multiplications and computes this product with an arbitrary small error.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/21/2017

A non-commutative algorithm for multiplying (7 × 7) matrices using 250 multiplications

We present a non-commutative algorithm for multiplying (7x7) matrices us...
11/05/2019

Some comments about measures, Jacobians and Moore-Penrose inverse

Some general problems of Jacobian computations in non-full rank matrices...
07/18/2017

A non-commutative algorithm for multiplying 5x5 matrices using 99 multiplications

We present a non-commutative algorithm for multiplying 5x5 matrices usin...
12/07/2020

SGD_Tucker: A Novel Stochastic Optimization Strategy for Parallel Sparse Tucker Decomposition

Sparse Tucker Decomposition (STD) algorithms learn a core tensor and a g...
05/24/2019

New ways to multiply 3 x 3-matrices

It is known since the 1970s that no more than 23 multiplications are req...
05/19/2021

Pseudo-Hadamard matrices of the first generation and an algorithm for producing them

Hadamard matrices in {0,1} presentation are square m× m matrices whose e...
12/11/2019

DGEMM performance is data-dependent

The DGEMM function is a widely used implementation of the matrix product...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.