A fast cellular method of matrix multiplication

DOI10.1007/s10559-008-9006-zzbMath1162.68482OpenAlexW2093666864MaRDI QIDQ946778

L. D. Jelfimova

Publication date: 24 September 2008

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

Full work available at URL: https://doi.org/10.1007/s10559-008-9006-z

zbMATH Keywords

parallel computationsmatrix multiplication algorithmcellular methods of linear algebra

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (7)

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

Cites Work

• An integrated approach to the design of processor arrays with systolic organization of computations
• Gaussian elimination is not optimal
• A New Algorithm for Inner Product
• A fast algorithm for matrix multiplication and its efficient realization on systolic arrays
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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