On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication

DOI10.1016/0304-3975(78)90045-2zbMath0418.68037OpenAlexW1983419392MaRDI QIDQ1131838

Hans F. de Groote

Publication date: 1978

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(78)90045-2

zbMATH Keywords

matrix multiplicationStrassen's algorithmvarieties of optimal algorithms for the computation of bilinear mappings

Mathematics Subject Classification ID

Quadratic and bilinear forms, inner products (15A63) Numerical linear algebra (65F99) Algorithms in computer science (68W99)

Related Items (21)

Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u/<Q(u)^{\ell}>\), \(\ell >1\)] ⋮ Unnamed Item ⋮ Some fast algorithms multiplying a matrix by its adjoint ⋮ On the complexity of the multiplication of matrices of small formats ⋮ Flip Graphs for Matrix Multiplication ⋮ A normal form for matrix multiplication schemes ⋮ On varieties of optimal algorithms for the computation of bilinear mappings. III. Optimal algorithms for the computation of \(xy\) and \(yx\) where \(x,y\in M_2(K)\) ⋮ On the algorithmic complexity of associative algebras ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication ⋮ Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. II: The algebra \(G[u/\langle{} u^ n \rangle\)] ⋮ The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices ⋮ On the additive complexity of 2 \(\times 2\) matrix multiplication ⋮ Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective ⋮ The border support rank of two-by-two matrix multiplication is seven ⋮ Equivalent polyadic decompositions of matrix multiplication tensors ⋮ Rank and optimal computation of generic tensors ⋮ The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations ⋮ On a class of primary algebras of minimal rank ⋮ Typical tensorial rank ⋮ On transformations of algorithms to multiply 2\(\times 2\) matrices

Cites Work

• Unnamed Item
• On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
• On the complexity of quaternion multiplication
• Gaussian elimination is not optimal
• On multiplication of 2 \(\times\) 2 matrices

This page was built for publication: On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication