Recursive cellular methods of matrix multiplication

DOI10.1007/S10559-023-00571-5MaRDI QIDQ6115822zbMATH OpenFDO

Authors L. D. Jelfimova

Publication date 13 July 2023

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

Full work available at URL https://doi.org/10.1007/S10559-023-00571-5

zbMATH Keywords

cellular analogs of matrix multiplication algorithmsfamily of cellular matrix multiplication methodslinear algebra

Mathematics Subject Classification ID

Numerical linear algebra (65F99) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• New cellular methods for matrix multiplication
• A fast cellular method of matrix multiplication
• A unified cellular method for matrix multiplication
• A mixed cellular method 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
• A unified cellular method for matrix multiplication
• An ultrafast cellular method for matrix multiplication
• Gaussian elimination is not optimal
• scientific article; zbMATH DE number 193901 (Why is no real title available?)
• New cellular methods for matrix multiplication

Cited in

(8)

• A mixed cellular method of matrix multiplication
• Recursive cell rotation method
• An ultrafast cellular method for matrix multiplication
• A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\)
• Fast algorithms for the basic operation of cellular methods of linear algebra
• New cellular methods for matrix multiplication
• A unified cellular method for matrix multiplication
• A fast cellular method of matrix multiplication

This page was built for publication: Recursive cellular methods of matrix multiplication

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