>>3 Since any algorithm for multiplying two n×n-matrices has to process all 2×n2-entries, there is an asymptotic lower bound of Ω(n2) operations. Raz (2002) proves a lower bound of Ω(n2 log n) for bounded coefficient arithmetic circuits over the real or complex numbers.
Name:
Anonymous2013-03-05 22:17
>>4
what does that even prove? i said O(log n) not O(n log n) fagshit dsfasdfasdfadsf i hate you cretin die in a fire stop mocking me
Name:
Anonymous2013-03-05 22:37
4x4 matrices will accumulate numerical error when you multiply them a lot, and some they start to become more distorsive linear transformations that rotations. And once they become like this, it isn't terribly intuitive how to make them a rotation again. Quanternions will also accumulate error when you multiply them, but you can always periodically renormalize them to get them back to a rotation.