But Strassen's Matrix Multiplication Algorithm take a performance near O(n^2,7)! Is there some other algorithm that take less time ?
2010/12/8 Rakib Ansary Saikot <[email protected]>: > Try using Strassen's Matrix Multiplication Algorithm. > > > Regards, > Rakib > > On 12/8/10, Luciano Junior <[email protected]> wrote: >> What is best multiply matrix algorithm for: >> >> -multiply a n x n matrix by another n x n matrix >> -multiply a m x n matrix by a n x p matrix >> >> I need a best performance cpu algorithm. >> Note: it can use a parallel programming concept. >> >> Thankfully. >> ---------------------------------------- >> Luciano. >> >> -- >> 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. >> >> > > -- > 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. > > -- ---------------------------------------- Luciano. -- 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.
