Laderman matrix multiplication algorithm can be constructed using Strassen algorithm and related tensor's isotropies - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2017

Laderman matrix multiplication algorithm can be constructed using Strassen algorithm and related tensor's isotropies

Résumé

In 1969, V. Strassen improves the classical~2x2 matrix multiplication algorithm. The current upper bound for 3x3 matrix multiplication was reached by J.B. Laderman in 1976. This note presents a geometric relationship between Strassen and Laderman algorithms. By doing so, we retrieve a geometric formulation of results very similar to those presented by O. Sykora in 1977.
Fichier principal
Vignette du fichier
RFC1703.pdf (154.56 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01494718 , version 1 (23-03-2017)
hal-01494718 , version 2 (28-03-2017)
hal-01494718 , version 3 (04-04-2017)
hal-01494718 , version 4 (10-05-2017)

Identifiants

Citer

Alexandre Sedoglavic. Laderman matrix multiplication algorithm can be constructed using Strassen algorithm and related tensor's isotropies. 2017. ⟨hal-01494718v4⟩
379 Consultations
645 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More