Skip to main content
SpringerLink
Log in

An Ultrafast Cellular Method for Matrix Multiplication

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The author considers the ultrafast cellular method of matrix multiplication that deals with cellular submatrices, interacts with well-known matrix multiplication cellular methods, and minimizes by 12.5% the computing complexity of cellular analogs of well-known matrix multiplication algorithms generated on their basis. The interaction of the ultrafast cellular method with the unified cellular method of matrix multiplication provides the highest (as compared with well-known methods) percentage (equal to 45.2%) of minimization of multiplicative, additive, and overall complexities of well-known matrix multiplication algorithms. The computing complexity of the ultrafast method is estimated using the models of getting cellular analogs of the traditional matrix multiplication algorithm.

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. W. K. Giloi, “Parallel supercomputer architectures and their programming models,” Parallel Computing, Vol. 20, 1443–1470 (1994).

    Article  Google Scholar 

  2. L. D. Jelfimova, “A fast cellular method of matrix multiplication,” Cybern. Syst. Analysis, Vol. 44, No. 3, 357–361 (2008).

    Article  Google Scholar 

  3. L. D. Jelfimova, “A mixed cellular method of matrix multiplication,” Cybern. Syst. Analysis, Vol. 45, No. 1, 19–24 (2009).

    Article  MathSciNet  Google Scholar 

  4. L. D. Jelfimova, “New cellular methods for matrix multiplication,” Cybern. Syst. Analysis, Vol. 49, No. 1, 15–25 (2013).

    Article  MathSciNet  Google Scholar 

  5. L. D. Jelfimova, “A unified cellular method for matrix multiplication,” Cybern. Syst. Analysis, Vol. 49, No. 5, 663–672 (2013).

    Article  MathSciNet  Google Scholar 

  6. V. Strassen, “Gaussian elimination is not optimal,” Numerische Mathematik, Vol. 13, 354–356 (1969).

    Article  MathSciNet  Google Scholar 

  7. J. D. Laderman, “A noncommutative algorithm for multiplying 3x3 matrices using 23 multiplications,” Bulletin of the American Mathematical Society, Vol. 82, No. 1, 126–128 (1976).

    Article  MathSciNet  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, November–December, 2018, pp. 47–55.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jelfimova, L.D. An Ultrafast Cellular Method for Matrix Multiplication. Cybern Syst Anal 54, 892–899 (2018). https://doi.org/10.1007/s10559-018-0092-2

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-018-0092-2

Keywords

Search

Navigation