Some New Non-Commutative Matrix Multiplication Algorithms of Size (n,m,6)

06/01/2023
by   Manuel Kauers, et al.
0

For various 2≤ n,m ≤ 6, we propose some new algorithms for multiplying an n× m matrix with an m × 6 matrix over a possibly noncommutative coefficient ring.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/13/2022

Skew-sparse matrix multiplication

Based on the observation that ℚ^(p-1) × (p-1) is isomorphic to a quotien...
research
04/11/2019

The MOMMS Family of Matrix Multiplication Algorithms

As the ratio between the rate of computation and rate with which data ca...
research
03/30/2022

Matrix Multiplication with Less Arithmetic Complexity and IO Complexity

After Strassen presented the first sub-cubic matrix multiplication algor...
research
12/30/2022

Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles

Cohn and Umans proposed a framework for developing fast matrix multiplic...
research
06/22/2019

Asymmetric Random Projections

Random projections (RP) are a popular tool for reducing dimensionality w...
research
01/04/2021

Some fast algorithms multiplying a matrix by its adjoint

We present a non-commutative algorithm for the multiplication of a 2 x 2...
research
09/27/2021

Distributed Computing With the Cloud

We investigate the effect of omnipresent cloud storage on distributed co...

Please sign up or login with your details

Forgot password? Click here to reset