AI Chat AI Image Generator AI Video Text to Speech

A non-commutative algorithm for multiplying (7 × 7) matrices using 250 multiplications

12/21/2017

∙

by Alexandre Sedoglavic, et al.

∙

∙

We present a non-commutative algorithm for multiplying (7x7) matrices using 250 multiplications and a non-commutative algorithm for multiplying (9x9) matrices using 520 multiplications. These algorithms are obtained using the same divide-and-conquer technique.

page 1

page 2

page 3

page 4

research

∙ 07/18/2017

A non-commutative algorithm for multiplying 5x5 matrices using 99 multiplications

We present a non-commutative algorithm for multiplying 5x5 matrices usin...

0 Alexandre Sedoglavic, et al. ∙

research

∙ 01/29/2021

The tensor rank of 5x5 matrices multiplication is bounded by 98 and its border rank by 89

We present a non-commutative algorithm for the product of 3x5 by 5x5 mat...

0 Alexandre Sedoglavic, et al. ∙

research

∙ 06/12/2020

Sallow: a heuristic algorithm for treedepth decompositions

We describe a heuristic algorithm for computing treedepth decompositions...

0 Marcin Wrochna, et al. ∙

research

∙ 03/12/2018

An algorithm for hiding and recovering data using matrices

We present an algorithm for the recovery of a matrix M (non-singular ∈ ...

0 Salomon S. Mizrahi, et al. ∙

research

∙ 12/22/2016

An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures

In this paper, an efficient divide-and-conquer (DC) algorithm is propose...

0 Shengguo Li, et al. ∙

research

∙ 09/04/2020

Interval hulls of N-matrices and almost P-matrices

We establish a characterization of almost P-matrices via a sign non-reve...

0 Projesh Nath Choudhury, et al. ∙

research

∙ 07/20/2020

Sign non-reversal property for totally positive matrices and testing total positivity on their interval hull

We establish a novel characterization of totally positive matrices via a...

0 Projesh Nath Choudhury, et al. ∙