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...

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...

additions and multiplications of scalars are necessary to perform some algorithm, for example, multiplication of matrices. Calculating the matrix product of...

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

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

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

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

rectangular matrix multiplication algorithm available instead of achieving rectangular multiplication via multiple square matrix multiplications. The best...

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

bounds on cap sets imply lower bounds on certain types of algorithms for matrix multiplication. The Games graph is a strongly regular graph with 729 vertices...

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...

variety of multiplication algorithms, M ( n ) {\displaystyle M(n)} below stands in for the complexity of the chosen multiplication algorithm. This table...

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

mathematics, the Bareiss algorithm, named after Erwin Bareiss, is an algorithm to calculate the determinant or the echelon form of a matrix with integer entries...

The matrix method is as efficient as the equivalent recursion, with two multiplications and two additions per step of the Euclidean algorithm. Bézout's...

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

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

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

peasant multiplication algorithm, does not. The example below illustrates "long multiplication" (the "standard algorithm", "grade-school multiplication"):...

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

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

randomization and is based on the fast matrix multiplication algorithm. This gives a randomized algorithm for general graphs with complexity O ( V 2.372...

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

and practical. The n × n orthogonal matrices form a group under matrix multiplication, the orthogonal group denoted by O(n), which—with its subgroups—is...

In numerical linear algebra, the tridiagonal matrix algorithm, also known as the Thomas algorithm (named after Llewellyn Thomas), is a simplified form...

counting the matrix–vector multiplication, each iteration does O ( n ) {\displaystyle O(n)} arithmetical operations. The matrix–vector multiplication can be...