A unified cellular method for matrix multiplication

DOI10.1007/S10559-013-9553-9MaRDI QIDQ465980zbMATH 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-9553-9

zbMATH Keywords

linear algebracellular method for matrix multiplicationmatrix multiplication algorithmrecursive Laderman's methodrecursive Strassen's method

Mathematics Subject Classification ID

Recommendations

• New cellular methods for matrix multiplication
• A mixed cellular method of matrix multiplication
• An ultrafast cellular method for matrix multiplication
• A fast cellular method of matrix multiplication
• Recursive cellular methods of 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 cellular methods for matrix multiplication

Cited in

(6)

• Fast algorithms for the basic operation of cellular methods of linear algebra
• 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
• An ultrafast cellular method for matrix multiplication

This page was built for publication: A unified cellular method for matrix multiplication

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