New fast hybrid matrix multiplication algorithms
From MaRDI portal
Publication:464981
DOI10.1007/s10559-011-9367-6zbMath1302.65103OpenAlexW2064811990MaRDI QIDQ464981
Publication date: 30 October 2014
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-011-9367-6
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Fast algorithms for the basic operation of cellular methods of linear algebra ⋮ New cellular methods for matrix multiplication ⋮ 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
- 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
This page was built for publication: New fast hybrid matrix multiplication algorithms
