I think 500*500*500 is only 125M. It is not that bad?
On Tue, Jan 4, 2011 at 1:39 PM, juver++ <[email protected]> wrote: > Your matrix has n*n dimensions. So to multiply it, you need to do O(N^3) > operations which is too slow for N=500. There is similar approach with a > vector multiplication instead of your idea. Btw, it is reached from the same > algorithm. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
