Hi Juan, Try looking up info on the "Winograd variation" of the Strassen method. I only had a quick glance at various hits I got in Google and on mathworld.wolfram.com but if it helps you out, great. ;)
Regards, TJ ----- Original Message ----- From: Juan Carlos Sent: Monday, October 25, 2004 6:13 PM Hi all, I have to multiply two matrices. The simple, brute force algorithm works quite efficiently with small matrices (e.g. <100x100) but I need to multiply matrices quite large > 2048 x 2048. Does anyone know any other algoritm for matrix multiplication? The matrices can be non-square. The Strassen algorithm seems to be a good method but if I remember correctly, it does only work with square matrices (not 100% sure though). Any help? Regards, Carlos _______________________________________________ msvc mailing list [EMAIL PROTECTED] See http://beginthread.com/mailman/listinfo/msvc_beginthread.com for subscription changes, and list archive.
