A tensor product formulation of Strassen's matrix multiplication algorithm
- Huang, C.-H.
- Johnson, J.R.
- Johnson, R.W.
DOIAbstract
AbstractTensor product notation is used to derive an iterative version of Strassen's matrix multiplication algorithm
AbstractTensor product notation is used to derive an iterative version of Strassen's matrix multiplication algorithm
Karatsuba’s multiplication algorithm uses three singledigit multiplications to perform one two-digit...
Research in tensor representation and analysis has been rising in popularity in direct re-sponse to ...
Matrix multiplication is commonly used in scientific computation. Given matrices A = (aij ) of size ...
AbstractTensor product notation is used to derive an iterative version of Strassen's matrix multipli...
AbstractWe report some experimental results on the performance of several sequential and parallel pr...
In 1969, V. Strassen improves the classical~2x2 matrix multiplication algorithm. The current upper ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
Tensor products of matrices play a very important role in approximation and interpolation. This pape...
The multiplication of a matrix by its transpose, ATA, appears as an intermediate operation in the s...
Abstract- This abstract is based on the discussion about the easy technique of seven rules of Strass...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
We present a new method for accelerating matrix multiplication asymptotically. Thiswork builds on re...
Abstract. Strassen's algorithm for fast matrix-matrix multiplication has been implemented for m...
Algorithms are proposed for the approximate calculation of the matrix product C̃ ≈ C = A · B, where ...
Karatsuba’s multiplication algorithm uses three singledigit multiplications to perform one two-digit...
Research in tensor representation and analysis has been rising in popularity in direct re-sponse to ...
Matrix multiplication is commonly used in scientific computation. Given matrices A = (aij ) of size ...
AbstractTensor product notation is used to derive an iterative version of Strassen's matrix multipli...
AbstractWe report some experimental results on the performance of several sequential and parallel pr...
In 1969, V. Strassen improves the classical~2x2 matrix multiplication algorithm. The current upper ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
Tensor products of matrices play a very important role in approximation and interpolation. This pape...
The multiplication of a matrix by its transpose, ATA, appears as an intermediate operation in the s...
Abstract- This abstract is based on the discussion about the easy technique of seven rules of Strass...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
We present a new method for accelerating matrix multiplication asymptotically. Thiswork builds on re...
Abstract. Strassen's algorithm for fast matrix-matrix multiplication has been implemented for m...
Algorithms are proposed for the approximate calculation of the matrix product C̃ ≈ C = A · B, where ...
Karatsuba’s multiplication algorithm uses three singledigit multiplications to perform one two-digit...
Research in tensor representation and analysis has been rising in popularity in direct re-sponse to ...
Matrix multiplication is commonly used in scientific computation. Given matrices A = (aij ) of size ...
Add to ORKG