2019 IEEE 26th Symposium on Computer Arithmetic (ARITH) 2019
DOI: 10.1109/arith.2019.00012
|View full text |Cite
|
Sign up to set email alerts
|

Faster Arbitrary-Precision Dot Product and Matrix Multiplication

Abstract: We present algorithms for real and complex dot product and matrix multiplication in arbitrary-precision floatingpoint 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 vi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 17 publications
0
4
0
Order By: Relevance
“…48 Simulations of the impedance of the full cell/electrode/individual circuit elements, and complex nonlinear least squares fitting of the equivalent circuit models to the data was performed using software programmed in Python 49 which relies on the scientific Python stack, [50][51][52] and for the 1D/2D elements the library mpmath was used to provide higher precision complex floating-point arithmetic. 53 Tortuosity estimation from TLMs.-The ionic resistivity in the infiltrated pore with length L, R ion,L [ cm] calculated from the TLMs is correlated to the effective electrode pore tortuosity τ el through the equation:…”
Section: Methodsmentioning
confidence: 99%
“…48 Simulations of the impedance of the full cell/electrode/individual circuit elements, and complex nonlinear least squares fitting of the equivalent circuit models to the data was performed using software programmed in Python 49 which relies on the scientific Python stack, [50][51][52] and for the 1D/2D elements the library mpmath was used to provide higher precision complex floating-point arithmetic. 53 Tortuosity estimation from TLMs.-The ionic resistivity in the infiltrated pore with length L, R ion,L [ cm] calculated from the TLMs is correlated to the effective electrode pore tortuosity τ el through the equation:…”
Section: Methodsmentioning
confidence: 99%
“…Exact convolutions divide a convolution operation into subproblems that involve the multiplication of the input vector with constants [13]. To optimize multiplication, related work [14]- [17] uses an adder graph tree structure that expresses addition, subtraction, and bit shifting.…”
Section: Related Workmentioning
confidence: 99%
“…• Berk (Berkowitz), Alg1 and Alg2 as in the previous section. All algorithms were implemented in Arb [18] which uses the accelerated dot product and matrix multiplication algorithms described in [19]. The LU, LU2, Alg1 and Alg2 implementations benefit from fast matrix multiplication while Hess, Hess2, Eig and Berk do not.…”
Section: 21mentioning
confidence: 99%