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?

  • 1
    $\begingroup$ Do you want the exact answer ? $\endgroup$ May 29 '13 at 18:32
  • 1
    $\begingroup$ @SureshVenkat Yes, although I'm curious about any fast approximate solutions as well. $\endgroup$
    – bobcat
    May 29 '13 at 23:25
  • $\begingroup$ This might help you. Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD) at arxiv.org/pdf/1506.03872.pdf, and some applications $\endgroup$
    – kelalaka
    Oct 20 '18 at 10:25

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.