I am using Strassen algorithm but still is taking too much time to finish the multiplication of matrix by 2000X2000 elements , can u please tell me any way how can i do it in JAVA.

\

Printable View

- 04-05-2011, 01:15 AMlulzimI need fast multiplication of array???
I am using Strassen algorithm but still is taking too much time to finish the multiplication of matrix by 2000X2000 elements , can u please tell me any way how can i do it in JAVA.

\ - 04-05-2011, 06:30 AMtoadaly
Personally, I would not use Java for this problem. I'd use c or maybe even CUDA, and I'd be very careful with how I dealt with memory to avoid cache hits.

Is the concern wall clock time, or CPU time (or both)? You can reduce wall clock time by throwing more CPUs/GPUs at it. Matrix multiplication is easily parallelizedusing the standard algorithm, but I'd have to think really hard to figure out how to parallelize something like the Strassen algorithm, and would probably give up and throw GPUs at it, or hire a mathematician if I had to.