6 citations · 21 across the 14 of their papers we have counts for
9 papers · 1 filter
Fast matrix multiplication via recursive 4x4x4:48 algorithms into practice
Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic +2
We present a fast algorithm for multiplying two 4x4 matrices using 48 multiplications and 204 other operations (addition, subtraction or scaling by a constant) over any ring contai…
A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications
Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic
The quest for non-commutative matrix multiplication algorithms over non-commutative rings in small dimensions has recently seen significant progress. Specifically, the number of sc…
Some fast algorithms multiplying a matrix by its adjoint
Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic
We present a non-commutative algorithm for the multiplication of a 2 x 2 block-matrix by its adjoint, defined by a matrix ring anti-homomorphism. This algorithm uses 5 block produc…
On fast multiplication of a matrix by its transpose
Jean-Guillaume Dumas, Clement Pernet, Alexandre Sedoglavic
We present a non-commutative algorithm for the multiplication of a 2x2-block-matrix by its transpose using 5 block products (3 recursive calls and 2 general products) over C or any…
A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications
Alexandre Sedoglavic
We present a non-commutative algorithm for multiplying (7x7) matrices using 250 multiplications and a non-commutative algorithm for multiplying (9x9) matrices using 520 multiplicat…
Laderman matrix multiplication algorithm can be constructed using Strassen algorithm and related tensor's isotropies
Alexandre Sedoglavic
In 1969, V. Strassen improves the classical~2x2 matrix multiplication algorithm. The current upper bound for 3x3 matrix multiplication was reached by J.B. Laderman in 1976. This no…