An ultrafast cellular method for matrix multiplication

DOI10.1007/S10559-018-0092-2zbMATH Open1491.65034OpenAlexW2901418423WikidataQ128816376 ScholiaQ128816376MaRDI QIDQ1735313FDOQ1735313

Authors: L. D. Jelfimova 

Publication date: 28 March 2019

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-018-0092-2

Recommendations

• A fast cellular method of matrix multiplication
• New cellular methods for matrix multiplication
• A unified cellular method for matrix multiplication
• A mixed cellular method of matrix multiplication
• Recursive cellular methods of matrix multiplication

zbMATH Keywords

linear algebracellular analogs of matrix multiplication algorithmscellular methodsfamily of cellular methods of matrix multiplication

Mathematics Subject Classification ID

Numerical linear algebra (65F99)

Cites Work

• Gaussian elimination is not optimal
• A mixed cellular method of matrix multiplication
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• New cellular methods for matrix multiplication
• A unified cellular method for matrix multiplication
• A fast cellular method of matrix multiplication

Cited In (6)

• A unified cellular method for matrix multiplication
• New cellular methods for matrix multiplication
• A fast cellular method of matrix multiplication
• A mixed cellular method of matrix multiplication
• Recursive cellular methods of matrix multiplication
• High-Performance Modular Multiplication on the Cell Processor

This page was built for publication: An ultrafast cellular method for matrix multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1735313)