A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications

Cites Work

Gaussian elimination is not optimal
On multiplication of 2 \(\times\) 2 matrices
A New Algorithm for Inner Product
Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
On the Number of Multiplications Required for Matrix Multiplication
Sur le calcul des produits de matrices. (Calculation of the product of matrices.)

Cited In (39)

Geometry and the complexity of matrix multiplication
On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field
A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
Equivalent polyadic decompositions of matrix multiplication tensors
Fast algorithms for the basic operation of cellular methods of linear algebra
The trace invariant and matrix inversion
The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices
Tensor Rank is Hard to Approximate
New fast hybrid matrix multiplication algorithms
A unified cellular method for matrix multiplication
New cellular methods for matrix multiplication
New ways to multiply \(3 \times 3\)-matrices
A noncommutative algorithm for multiplying 5 X 5 matrices using 103 multiplications
The bilinear complexity and practical algorithms for matrix multiplication
Improved method for finding optimal formulas for bilinear maps in a finite field
An introduction to the computational complexity of matrix multiplication
Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
A Derivative-Free Nonlinear Least Squares Solver
Fast commutative matrix algorithms
A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\)
Flip Graphs for Matrix Multiplication
Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
A new fast recursive matrix multiplication algorithm
Title not available (Why is that?)
Finding complex-valued solutions of brent equations using nonlinear least squares
Recursive cellular methods of matrix multiplication
Compressible FHE with applications to PIR
On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
Semi-analytical solution of Brent equations
An adaptive prefix-assignment technique for symmetry reduction
On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry
An ultrafast cellular method for matrix multiplication
The tensor Rank of \(5 \times 5\) matrices multiplication is bounded by 98 andits border Rank by 89
Numerical CP decomposition of some difficult tensors
On the complexity of the multiplication of matrices of small formats
Optimization techniques for small matrix multiplication
On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication
A normal form for matrix multiplication schemes
Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25

This page was built for publication: A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4085178)