New cellular methods for matrix multiplication

DOI10.1007/S10559-013-9480-9MaRDI QIDQ465910zbMATH OpenOpenAlexFDO

Authors 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

Recommendations

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

Cites work

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

Cited in

(8)

• A fast cellular method of matrix multiplication
• Fast algorithms for the basic operation of cellular methods of linear algebra
• A mixed cellular method of matrix multiplication
• Recursive cellular methods of matrix multiplication
• An ultrafast cellular method for matrix multiplication
• scientific article; zbMATH DE number 4106255 (Why is no real title available?)
• A unified cellular method for matrix multiplication
• Computation of a determinant and a matrix product in cellular automata

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

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