Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective

DOI10.1007/s11565-019-00318-1zbMath1427.68374arXiv1708.08083OpenAlexW2753036677MaRDI QIDQ2280138

Vladimir Lysikov, Christian Ikenmeyer

Publication date: 17 December 2019

Published in: Annali dell'Università di Ferrara. Sezione VII. Scienze Matematiche (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.08083

zbMATH Keywords

matrix multiplicationelementaryStrassen's algorithmcoordinate-free

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical linear algebra (65F99) Linear algebra (educational aspects) (97H60)

Cites Work

• On a class of primary algebras of minimal rank
• On transformations of algorithms to multiply 2\(\times 2\) matrices
• On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
• Optimum computation of p bilinear forms
• A simple proof of Strassen's result
• The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices
• Gaussian elimination is not optimal
• Sur le calcul des produits de matrices. (Calculation of the product of matrices.)
• Powers of tensors and fast matrix multiplication
• The connection between two multiplication algorithms
• Maximal extensions with simple multiplication for the algebra of matrices of the second order
• Fast matrix multiplication and its algebraic neighbourhood
• On Obtaining Upper Bounds on the Complexity of Matrix Multiplication
• The Geometry of Rank Decompositions of Matrix Multiplication I: 2 × 2 Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective