New cellular methods for matrix multiplication

DOI10.1007/s10559-013-9480-9zbMath1302.65101OpenAlexW2012788412MaRDI QIDQ465910

L. D. Jelfimova

Publication date: 24 October 2014

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

Full work available at URL: https://doi.org/10.1007/s10559-013-9480-9

zbMATH Keywords

Laderman's algorithmcellular method of matrix multiplicationfast hybrid algorithm of matrix multiplication

Mathematics Subject Classification ID

Related Items (4)

Fast algorithms for the basic operation of cellular methods of linear algebra ⋮ Recursive cellular methods of matrix multiplication ⋮ A unified cellular method for matrix multiplication ⋮ An ultrafast cellular method for matrix multiplication

Cites Work

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

This page was built for publication: New cellular methods for matrix multiplication