Analyzing group based matrix multiplication algorithms

Authors:
Jon Gonzalez-Sanchez;Laureano Gonzalez-Vega;Alejandro Piñera-Nicolas;Irene Polo-Blanco;Jorge Caravantes;Ignacio F. Rua
Affiliations:
Universidad de Cantabria, Santander, Spain;Universidad de Cantabria, Santander, Spain;Universidad de Cantabria, Santander, Spain;Universidad de Cantabria, Santander, Spain;Università degli Studi di Genova, Genova, Italy;Universidad de Oviedo, Oviedo, Spain
Venue:
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Year:
2009

Citing 4
Cited 0

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
A Group-Theoretic Approach to Fast Matrix Multiplication

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Group-theoretic Algorithms for Matrix Multiplication

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Fast matrix multiplication is stable

Numerische Mathematik

Quantified Score

Hi-index	0.00

Visualization

Abstract

We review different group based algorithms for matrix multiplication and discuss the relations between the combinatorial properties of the used group and the complexity of these algorithms. We introduce a variant of an algorithm based on the ideas exposed in [4] well-adapted for experimentation. Finally we show how this approach can also be used for matrix multiplication over a field with characteristic different from 2.