Matrix multiplication over word-size modular rings using approximate formulae - Archive ouverte HAL Access content directly
Journal Articles ACM Transactions on Mathematical Software Year : 2016

Matrix multiplication over word-size modular rings using approximate formulae

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 paper, we show a novel way to use the approximate formula in the special case where the ring is Z/pZ. Besides, 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.
Fichier principal
Vignette du fichier
14_bini_matmul_free.pdf (298.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00987812 , version 1 (06-05-2014)

Identifiers

Cite

Brice Boyer, Jean-Guillaume Dumas. Matrix multiplication over word-size modular rings using approximate formulae. ACM Transactions on Mathematical Software, 2016, 42 (3-20), ⟨10.1145/2829947⟩. ⟨hal-00987812⟩
308 View
365 Download

Altmetric

Share

Gmail Facebook X LinkedIn More