The Tensor Rank of 5x5 Matrices Multiplication is Bounded by 98 andIts Border Rank by 89
Résumé
We present a non-commutative algorithm for the product of 3 x 5 by 5 x 5 matrices using 58 multiplications. This algorithm allows to construct a non-commutative algorithm for multiplying 5 x 5 (resp. 10 x 10, 15 x 15) 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.
Domaines
Informatique [cs]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|