#Matrix multiplication
1 messages · Page 1 of 1 (latest)
Thanks, I found a naive implementation in https://github.com/odin-lang/Odin/blob/master/examples/demo/demo.odin , Im going to try to optimize it
there are loads of multiplication algorithms, for example https://en.wikipedia.org/wiki/Strassen_algorithm
check them out, but also consider simd and so on
In linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix multiplication algorithm for large matrices, with a better asymptotic complexity, although the naive algorithm is often better for smaller matrices. The Strassen algorithm is slower than the fas...
Never mind, vector multiplication works great