Fast hybrid matrix multiplication algorithms

DOI10.1007/s10559-010-9233-yzbMath1288.65038OpenAlexW4234403429MaRDI QIDQ2452754

L. D. Jelfimova

Publication date: 5 June 2014

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

Full work available at URL: https://doi.org/10.1007/s10559-010-9233-y

zbMATH Keywords

linear algebrabasic operationcellular methodmatrix multiplication algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Iterative numerical methods for linear systems (65F10)

Related Items

Fast algorithms for the basic operation of cellular methods of linear algebra, New fast hybrid matrix multiplication algorithms, A new fast recursive matrix multiplication algorithm, A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\)

Cites Work

• Unnamed Item
• Matrix multiplication via arithmetic progressions
• A fast cellular method of matrix multiplication
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• An integrated approach to the design of processor arrays with systolic organization of computations
• Gaussian elimination is not optimal
• On multiplication of 2 \(\times\) 2 matrices
• Partial and Total Matrix Multiplication
• On the Asymptotic Complexity of Matrix Multiplication
• A New Algorithm for Inner Product
• A fast algorithm for matrix multiplication and its efficient realization on systolic arrays