Randomization of Approximate Bilinear Computation for Matrix Multiplication
From MaRDI portal
Publication:6318932
arXiv1905.07439MaRDI QIDQ6318932
Author name not available (Why is that?)
Publication date: 17 May 2019
Abstract: We present a method for randomizing formulas for bilinear computation of matrix products. We consider the implications of such randomization when there are two sources of error: One due to the formula itself only being approximately correct, and one due to using floating point arithmetic. Our theoretical results and numerical experiments indicate that our method can improve performance when each of these error sources are present individually, as well as when they are present at the same time.
Has companion code repository: https://github.com/OsmanMalik/random-approximate-matrix-multiplication
This page was built for publication: Randomization of Approximate Bilinear Computation for Matrix Multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6318932)
