DeepAI AI Chat
Log In Sign Up

Randomization of Approximate Bilinear Computation for Matrix Multiplication

by   Osman Asif Malik, et al.
University of Colorado Boulder

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.


page 1

page 2

page 3

page 4


Random Sampling for Distributed Coded Matrix Multiplication

Matrix multiplication is a fundamental building block for large scale co...

Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds

Given a real matrix A with n columns, the problem is to approximate the ...

Sparse approximate matrix-matrix multiplication with error control

We propose a method for strict error control in sparse approximate matri...

Error bounds for Lanczos-based matrix function approximation

We analyze the Lanczos method for matrix function approximation (Lanczos...

Some fast algorithms multiplying a matrix by its adjoint

We present a non-commutative algorithm for the multiplication of a 2 x 2...

Computing Whittle (and Gittins) Index in Subcubic Time

Whittle index is a generalization of Gittins index that provides very ef...

Code Repositories


Matlab and C code for experiments with randomization of approximate bilinear computation for matrix multiplication

view repo