New fast hybrid matrix multiplication algorithms
From MaRDI portal
Publication:464981
Recommendations
- Fast hybrid matrix multiplication algorithms
- A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\)
- A new fast recursive matrix multiplication algorithm
- The bilinear complexity and practical algorithms for matrix multiplication
- On practical algorithms for accelerated matrix multiplication
Cites work
- scientific article; zbMATH DE number 193901 (Why is no real title available?)
- A New Algorithm for Inner Product
- A fast algorithm for matrix multiplication and its efficient realization on systolic arrays
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- Fast hybrid matrix multiplication algorithms
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
Cited in
(13)- Fast algorithms with preprocessing for matrix-vector multiplication problems
- Fast algorithms for the basic operation of cellular methods of linear algebra
- A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\)
- A new fast recursive matrix multiplication algorithm
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
- New algorithms for relaxed multiplication
- scientific article; zbMATH DE number 1022807 (Why is no real title available?)
- scientific article; zbMATH DE number 1419996 (Why is no real title available?)
- New cellular methods for matrix multiplication
- Fast hybrid matrix multiplication algorithms
- scientific article; zbMATH DE number 1779892 (Why is no real title available?)
- Fast Multiresolution Algorithms for Matrix-Vector Multiplication
- Fast algorithms for complex matrix multiplication using surrogates
This page was built for publication: New fast hybrid matrix multiplication algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464981)
