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

Cites work

A New Algorithm for Inner Product
Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
Gaussian elimination is not optimal
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
On multiplication of 2 \(\times\) 2 matrices
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)

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

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)