Name
Abstract | ||
|---|---|---|
Bini-Capovani-Lotti-Romani approximate formula (or border rank) for matrix multiplication achieves a better complexity than Strassen’s matrix multiplication formula. In this article, we show a novel way to use the approximate formula in the special case where the ring is Z/pZ. In addition, we show an implementation à la FFLAS--FFPACK, where p is a word-size modulo, that improves on state-of-the-art Z/pZ matrix multiplication implementations. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2829947 | ACM Trans. Math. Softw. |
Keywords | Field | DocType |
Algorithms,Performance,Exact linear algebra,matrix multiplication,efficient implementations,Strassen-Winograd's algorithm,Bini-Capovani-Lotti-Romani approximate bilinear algorithm,symbolic-numeric computing,memory placement and scheduling | Multiplication algorithm,Modulo,Coppersmith–Winograd algorithm,Theoretical computer science,Strassen algorithm,Word (computer architecture),Diagonal matrix,Matrix multiplication,Mathematics,Special case | Journal |
Volume | Issue | ISSN |
42 | 3 | 0098-3500 |
Citations | PageRank | References |
2 | 0.36 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Brice Boyer | 1 | 39 | 3.57 |
| Jean-Guillaume Dumas | 2 | 428 | 68.48 |