A new fast recursive matrix multiplication algorithm

DOI10.1007/s10559-019-00163-2zbMath1432.65055OpenAlexW2965436164MaRDI QIDQ2281348

Yanyan Li

Publication date: 19 December 2019

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

Full work available at URL: https://doi.org/10.1007/s10559-019-00163-2

zbMATH Keywords

block-recursive Strassen's algorithmblock-recursive Winograd's-Strassen's algorithmfast hybrid matrix multiplication algorithms

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Numerical linear algebra (65F99)

Related Items

A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\)

Cites Work

• New fast hybrid matrix multiplication algorithms
• Fast hybrid matrix multiplication algorithms
• Gaussian elimination is not optimal
• On multiplication of 2 \(\times\) 2 matrices
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• A New Algorithm for Inner Product
• A fast algorithm for matrix multiplication and its efficient realization on systolic arrays