Paper Info
Title
Randomization of Approximate Bilinear Computation for Matrix Multiplication.
Abstract
We present a method for randomizing a formula for bilinear computation of matrix products. We consider the implications of such randomization when the formula itself is approximate, and when the formula is exact but its computation is plagued by numerical error due to finite precision arithmetic. Our theoretical results and numerical experiments indicate that our method can improve performance in both settings for a negligible increase in computational complexity.
Year
DOI
Venue
2019
10.1080/23799927.2020.1861104
arXiv: Data Structures and Algorithms
DocType
Volume
Issue
Journal
abs/1905.07439
1
ISSN
Citations 
PageRank 
International Journal of Computer Mathematics: Computer Systems Theory, 6:1, 54-93, 2021
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Osman Asif Malik121.74
stephen becker2478.04