Advertisement

A fast non-commutative algorithm for matrix multiplication

  • Ondrej Sýkora
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)

Abstract

In the paper a non-commutative algorithm for the multiplication of two square matrices of order n is presented. The algorithm requires n3-(n-1)2 multiplications and n3-n2+ 11 (n-1)2 additions. The recursive application of the algorithm for matrices of order nk leads to \(O(_n ^{k\log _n [n^3 - (n - 1)^2 ]} )\)operations to be executed.It is shown that some well-known algorithms are special cases of our algorithm. Finally, an improvement of the algorithm is given for matrices of order 5.

Keywords

Matrix Multiplication Arithmetical Operation Expression A23632 Recursive Application Require Scalar 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Strassen, V., Gaussian elimination is not optimal, Numer.Math. 13, 354–356 / 1969 /.Google Scholar
  2. 2.
    Hopcroft, J.E. and Kerr, L.R., Some techniques for proving certain simple programs optimal, Proc. Tenth Ann. Symposium on Switching and Automata Theory, pp. 36–45, / 1969 /.Google Scholar
  3. 3.
    Winograd, S., On multiplication of 2×2 matrices, Linear Algebra and its Applications 4, 381–388 / 1971 /.CrossRefGoogle Scholar
  4. 4.
    Fischer, P.C., Further schemes for combining matrix algorithms, in: Automata, Languages and Programming — 2nd Colloquium / Loeckx, J., Hrsg. / University of Saarbrücken. Lecture Notes in Computer Science / 1974 /.Google Scholar
  5. 5.
    Probert, R.L., On the complexity of matrix multiplication, University of Waterloo, Ontario, Tech. Report CS-73-27 / 1973 /.Google Scholar
  6. 6.
    Gastinel, N., Sur le calcul des produits de matrices, Numer. Math. 17, 222–229 / 1971 /.CrossRefGoogle Scholar
  7. 7.
    Hopcroft, J. and Kerr, L., On minimizing the number of multiplications necessary for matrix multiplication, SIAM J. Appl. Math. 20, 30–36 / 1971 /.CrossRefGoogle Scholar
  8. 8.
    Hopcroft, J. and Musinski, J., Duality aplied to the complexity of matrix multiplication and other bilinear forms, SIAM J. Comput. 2, 159–173 / 1973 /.CrossRefGoogle Scholar
  9. 9.
    Laderman, J. D., A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications, Bull. of the Amer. Math. Soc. Vol. 82, Num. 1, Jan. / 1976 /.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Ondrej Sýkora
    • 1
  1. 1.Institute of Technical CyberneticsSlovak Academy of SciencesBratislavaCzechoslovakia

Personalised recommendations