Skip to main content
SpringerLink
Log in

New fast hybrid matrix multiplication algorithms

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

New hybrid algorithms are proposed for multiplying (n × n) matrices. They are based on Laderman’s algorithm for multiplying (3 × 3)-matrices. As compared with well-known hybrid matrix multiplication algorithms, the new algorithms are characterized by the minimum computational complexity. The multiplicative, additive, and overall complexities of the algorithms are estimated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. D. Elfimova and Yu. V. Kapitonova, “A fast algorithm for matrix multiplication and its efficient realization on systolic arrays,” Cybernetics and Systems Analysis, Vol. 37, No. 1, 109–121 (2001).

    Article  MathSciNet  MATH  Google Scholar 

  2. L. D. Elfimova, “Fast Hybrid Matrix Multiplication Algorithms,” Cybernetics and Systems Analysis, Vol. 46, No. 4, 563–573 (2010).

    Article  Google Scholar 

  3. V. Strassen, “Gaussian elimination is not optimal,” Numer. Math., 13, 354–356 (1969).

    Article  MathSciNet  MATH  Google Scholar 

  4. S. Winograd, “On multiplication of 2 × 2 matrices,” Linear Algebra and Its Application, 4, 381–388 (1971).

    Article  MathSciNet  MATH  Google Scholar 

  5. S. A. Winograd, “A new algorithm for inner product,” IEEE Trans. Comp., C-18, 693–694 (1968).

    Article  Google Scholar 

  6. J. D. Laderman, “A noncommutative algorithm for multiplying 3 × 3 matrices using 23 multiplications,” Bull. Amer. Math. Soc., 82, No. 1, 126–128 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  7. J. J. Modi, Parallel Algorithms and Matrix Computation, Clarendon Press, Oxford (1988).

    MATH  Google Scholar 

  8. D. K. Faddeev and V. N. Faddeeva, Computational Methods of Linear Algebra [in Russian], Fizmatgiz, Moscow–Leningrad (1963).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    L. D. Jelfimova

Authors
  1. L. D. Jelfimova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to L. D. Jelfimova.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 59–67, November–December 2011.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jelfimova, L.D. New fast hybrid matrix multiplication algorithms. Cybern Syst Anal 47, 881–888 (2011). https://doi.org/10.1007/s10559-011-9367-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-011-9367-6

Keywords

Search

Navigation