Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
Résumé
Strassen's algorithm was the first sub-cubic algorithm for matrix multiplication. Its improvement by Winograd led to a highly practicable algorithm. In this report, we propose new schedules of the algorithm, that reduce of the extra memory allocation, by two differents means : either by introducing a few pre-additions, or by overwritting the input matrices.
Domaines
Logiciel mathématique [cs.MS]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|