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

DOI10.1007/s10559-021-00345-xOpenAlexW3143939112MaRDI QIDQ2043999

L. D. Jelfimova

Publication date: 4 August 2021

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

Full work available at URL: https://doi.org/10.1007/s10559-021-00345-x

zbMATH Keywords

linear algebrafamily of fast hybrid matrix multiplication algorithmsLaderman's block-recursive matrix multiplication algorithmWinograd's algorithm for inner product

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Computability and recursion theory (03Dxx)

Cites Work

• New fast hybrid matrix multiplication algorithms
• A new fast recursive matrix multiplication algorithm
• 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