An optimal algorithm for matrix multiplication
From MaRDI portal
An \(O(n^ 2)\) algorithm for matrix multiplication is given for matrices with all rational elements. The authors point out the fact that although the results are theoretically important, the implementation of the algorithm may be difficult since it requires the use of very large integers and, presently, most computers cannot handle such integers.
Recommendations
Cited in
(28)- On transformations of algorithms to multiply 2 2 matrices
- On an optimal algorithm for matrix multiplication
- A matrix extension of Winograd's inner product algorithm
- Matrix multiplication for finite algebraic systems
- A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications
- The matrix capacity of a tensor
- A practical algorithm for faster matrix multiplication
- Matrix-vector multiplication in sub-quadratic time (some preprocessing required)
- Algorithm 898
- Two new algorithms for matrix multiplication and vector convolution
- scientific article; zbMATH DE number 3856292 (Why is no real title available?)
- scientific article; zbMATH DE number 4149457 (Why is no real title available?)
- On the complexity of some algorithms of matrix multiplication
- Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays
- scientific article; zbMATH DE number 4072257 (Why is no real title available?)
- scientific article; zbMATH DE number 151736 (Why is no real title available?)
- scientific article; zbMATH DE number 1464691 (Why is no real title available?)
- scientific article; zbMATH DE number 1501237 (Why is no real title available?)
- scientific article; zbMATH DE number 823632 (Why is no real title available?)
- On the Reuse of Additions in Matrix Multiplication
- scientific article; zbMATH DE number 1419996 (Why is no real title available?)
- On obtaining upper bounds on the complexity of matrix multiplication
- Optimization techniques for small matrix multiplication
- Strassen's matrix multiplication algorithm for matrices of arbitrary order
- A new algorithm for Boolean matrix multiplication
- Optimization techniques for small matrix multiplication
- Improved algorithm of matrix multiplication based on memory
- An algorithm for multiplication of concatenated matrices
This page was built for publication: An optimal algorithm for matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911703)
