Consequences of the Moosbauer-Poole Algorithms
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908356089741312 |
|---|---|
| author | Kauers, Manuel Wood, Isaac |
| author_facet | Kauers, Manuel Wood, Isaac |
| contents | Moosbauer and Poole have recently shown that the multiplication of two $5\times 5$ matrices requires no more than 93 multiplications in the (possibly non-commutative) coefficient ring, and that the multiplication of two $6\times 6$ matrices requires no more than 153 multiplications. Taking these multiplication schemes as starting points, we found improved matrix multiplication schemes for various rectangular matrix formats using a flip graph search. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_05896 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Consequences of the Moosbauer-Poole Algorithms Kauers, Manuel Wood, Isaac Symbolic Computation Moosbauer and Poole have recently shown that the multiplication of two $5\times 5$ matrices requires no more than 93 multiplications in the (possibly non-commutative) coefficient ring, and that the multiplication of two $6\times 6$ matrices requires no more than 153 multiplications. Taking these multiplication schemes as starting points, we found improved matrix multiplication schemes for various rectangular matrix formats using a flip graph search. |
| title | Consequences of the Moosbauer-Poole Algorithms |
| topic | Symbolic Computation |
| url | https://arxiv.org/abs/2505.05896 |