Hi Eigen guys,

I'm wondering if in matrix multiplication routines does Eigen use Strassen matrix multiplication algorithm matrix when feasible.

If not, is it because of overhead of recursive functions or what else? Numerical stability?

Thank you

No, Eigen does not use the Strassen algorithm. As far as I know, nobody really looked into this.

actually, I made an implementation a while ago which was indeed faster but only for matrices larger than let's say 2k x 2k. Note that it is suitable only for types with exact arithmetic. Otherwise the error is pretty high.

Hi Gael,

Has your Strassen implementation been integrated into Eigen, or is the code available anywhere? I'm interested in pursuing this direction to speed up large matrix multiplies, and maybe using your code as a starting point would be helpful.

Thanks,
Rasmus

I though it was in Eigen/bench/ folder, but I cannot find it anymore....