Skip to Main content Skip to Navigation
Conference papers

Faster arbitrary-precision dot product and matrix multiplication

Fredrik Johansson 1 
1 LFANT - Lithe and fast algorithmic number theory
IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : We present algorithms for real and complex dot product and matrix multiplication in arbitrary-precision floating-point and ball arithmetic. A low-overhead dot product is implemented on the level of GMP limb arrays; it is about twice as fast as previous code in MPFR and Arb at precision up to several hundred bits. Up to 128 bits, it is 3-4 times as fast, costing 20-30 cycles per term for floating-point evaluation and 40-50 cycles per term for balls. We handle large matrix multiplications even more efficiently via blocks of scaled integer matrices. The new methods are implemented in Arb and significantly speed up polynomial operations and linear algebra.
Complete list of metadata
Contributor : Fredrik Johansson Connect in order to contact the contributor
Submitted on : Thursday, May 9, 2019 - 3:55:04 PM
Last modification on : Wednesday, February 2, 2022 - 3:54:28 PM


Files produced by the author(s)


  • HAL Id : hal-01980399, version 2
  • ARXIV : 1901.04289



Fredrik Johansson. Faster arbitrary-precision dot product and matrix multiplication. 26th IEEE Symposium on Computer Arithmetic (ARITH26), Jun 2019, Kyoto, Japan. ⟨hal-01980399v2⟩



Record views


Files downloads