Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms...

complexity of matrix multiplication dictates how quickly the operation of matrix multiplication can be performed. Matrix multiplication algorithms are a central...

in linear algebra, matrix multiplication is a binary operation that produces a matrix from two matrices. For matrix multiplication, the number of columns...

Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix multiplication algorithm for...

A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient...

In computer science, Cannon's algorithm is a distributed algorithm for matrix multiplication for two-dimensional meshes first described in 1969 by Lynn...

denotes the n-by-n identity matrix and the multiplication used is ordinary matrix multiplication. If this is the case, then the matrix B is uniquely determined...

Matrix chain multiplication (or the matrix chain ordering problem) is an optimization problem concerning the most efficient way to multiply a given sequence...

outperforms this "naive" algorithm; it needs only n2.807 multiplications. Theoretically faster but impractical matrix multiplication algorithms have been developed...

Coppersmith–Winograd algorithm: square matrix multiplication Freivalds' algorithm: a randomized algorithm used to verify matrix multiplication Strassen algorithm: faster...

Freivalds' algorithm (named after Rūsiņš Mārtiņš Freivalds) is a probabilistic randomized algorithm used to verify matrix multiplication. Given three...

introduced the new algorithm with its low complexity, and Stephen Cook, who cleaned the description of it, is a multiplication algorithm for large integers...

space) Strassen algorithm (algorithm for matrix multiplication that is faster than the conventional matrix multiplication algorithm) Eves, Howard (1980)...

known matrix multiplication algorithms. For sparse graphs, with few edges, repeated breadth-first search is faster than matrix multiplication. Assuming...

{nmk}{CM^{1/2}}}} . Direct computation verifies that the tiling matrix multiplication algorithm reaches the lower bound. Consider the following running-time...

dimensions m×q, and will require m*n*q scalar multiplications (using a simplistic matrix multiplication algorithm for purposes of illustration). For example...

modular multiplicative inverse of b modulo a. Similarly, the polynomial extended Euclidean algorithm allows one to compute the multiplicative inverse...

sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks (PDF). ACM Symp. on Parallelism in Algorithms and Architectures...

cache-oblivious algorithms are known for matrix multiplication, matrix transposition, sorting, and several other problems. Some more general algorithms, such as...

block Lanczos algorithm is an algorithm for finding the nullspace of a matrix over a finite field, using only multiplication of the matrix by long, thin...

then the inverse of the example matrix should be used, which coincides with its transpose. Since matrix multiplication has no effect on the zero vector...

the QR algorithm or QR iteration is an eigenvalue algorithm: that is, a procedure to calculate the eigenvalues and eigenvectors of a matrix. The QR algorithm...

This improved a previous time bound for matrix multiplication algorithms, the Coppersmith–Winograd algorithm, that had stood as the best known for 24...

algorithm. In the same paper he also presented an asymptotically fast algorithm to perform matrix inversion, based on the fast matrix multiplication algorithm...

Min-plus matrix multiplication, also known as distance product, is an operation on matrices. Given two n × n {\displaystyle n\times n} matrices A = (...

triangular matrix. The convolution operation can be constructed as a matrix multiplication, where one of the inputs is converted into a Toeplitz matrix. For...

include: fast large-integer multiplication algorithms and polynomial multiplication, efficient matrix–vector multiplication for Toeplitz, circulant and...

brute-force matrix multiplication (which needs O ( n 3 ) {\displaystyle O(n^{3})} multiplications) was the Strassen algorithm: a recursive algorithm that needs...

Floyd–Warshall algorithm (also known as Floyd's algorithm, the Roy–Warshall algorithm, the Roy–Floyd algorithm, or the WFI algorithm) is an algorithm for finding...

matrix, binary matrix, relation matrix, Boolean matrix, or (0, 1)-matrix is a matrix with entries from the Boolean domain B = {0, 1}. Such a matrix can...