Compressed Modular Matrix Multiplication
| dc.creator | Dumas, Jean-Guillaume | |
| dc.creator | Fousse, Laurent | |
| dc.creator | Salvy, Bruno | |
| dc.date | 2008-03-13 | |
| dc.date.accessioned | 2026-07-07T12:17:39Z | |
| dc.date.available | 2026-07-07T12:17:39Z | |
| dc.description | We propose to store several integers modulo a small prime into a single machine word. Modular addition is performed by addition and possibly subtraction of a word containing several times the modulo. Modular Multiplication is not directly accessible but modular dot product can be performed by an integer multiplication by the reverse integer. Modular multiplication by a word containing a single residue is a also possible. Therefore matrix multiplication can be performed on such a compressed storage. We here give bounds on the sizes of primes and matrices for which such a compression is possible. We also explicit the details of the required compressed arithmetic routines. | |
| dc.description | Published in: MICA'2008 : Milestones in Computer Algebra, Tobago : Trinité-et-Tobago (2008) | |
| dc.identifier | https://arxiv.org/abs/0803.1975 | |
| dc.identifier | http://arxiv.org/abs/0803.1975 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/212146 | |
| dc.subject | Symbolic Computation | |
| dc.title | Compressed Modular Matrix Multiplication | |
| dc.type | text |