Advertisement

Fast Matrix Multiplication

Started by June 06, 2002 06:09 PM
0 comments, last by sQuid 22 years, 8 months ago
Does anyone know of any matrix multiplication algorithms that can do better than the trivial one involving n3 multiplications?
Yes, you can do it in nlog27 using Strassen''s algorithm (google). But the multiplicative constant makes it not worth it for small matrices.

Linear algebra library : BLAS

Documents [ GDNet | MSDN | STL | OpenGL | Formats | RTFM | Asking Smart Questions ]
C++ Stuff [ MinGW | Loki | SDL | Boost. | STLport | FLTK | ACCU Recommended Books ]
"Debugging is twice as hard as writing the code in the first place. Therefore, if you write the code as cleverly as possible, you are, by definition, not smart enough to debug it." — Brian W. Kernighan

This topic is closed to new replies.

Advertisement