<p>Given two matrices, I'm interested in finding the largest element of their product. I wonder if it's possible to do it significantly faster than the matrix multiplication the solution seems to require?</p>

CC BY-SA 3.0
2013-05-29T18:32:46.893Z
Do you want the exact answer ?
Suresh Venkat
CC BY-SA 3.0
2013-05-29T23:25:01.287Z
@SureshVenkat Yes, although I'm curious about any fast approximate solutions as well.
MWB
CC BY-SA 4.0
2018-10-20T10:25:01.753Z
This might help you. `Diamond Sampling for Approximate
Maximum All-pairs Dot-product (MAD)` at https://arxiv.org/pdf/1506.03872.pdf, and some [applications](http://www.maths.manchester.ac.uk/~srelton/files/ral_seminar_May16.pdf)
kelalaka
<optimization><time-complexity><linear-algebra><matrices><matrix-product>
the largest element of a matrix product
MWB
# the largest element of a matrix product

(Asked by: username_0 on 2013-05-29)

Given two matrices, I'm interested in finding the largest element of their product. I wonder if it's possible to do it significantly faster than the matrix multiplication the solution seems to require?

**Tags:** optimization, time-complexity, linear-algebra, matrices, matrix-product
> **Comments:**
> **username_1**: Do you want the exact answer ?  
> **username_0**: @SureshVenkat Yes, although I'm curious about any fast approximate solutions as well.  
> **username_2**: This might help you. `Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD)` at https://arxiv.org/pdf/1506.03872.pdf, and some [applications](http://www.maths.manchester.ac.uk/~srelton/files/ral_seminar_May16.pdf)  

---

## 0 answers

