@Arun: The problem with Strassen usually isn't overflow, but instability. The error bounds will be based on the largest element, rather than on each individual element. You won't want to recurse all the way to 1x1 blocks, as the bookkeeping becomes more expensive as recursion depth increases.
Dave On Feb 27, 10:12 pm, atul anand <atul.87fri...@gmail.com> wrote: > strassen multiplication , but it may cause overflow > > On Tue, Feb 28, 2012 at 5:27 AM, Arun Vishwanathan > <aaron.nar...@gmail.com>wrote: > > > > > Hi all, > > > We have this challenge to make the fastest executing serial matrix > > multiplication code. I have tried using matrix transpose( in C for row > > major ) and loop unrolling.I was able to obtain little speedup. Does anyone > > have any hints/papers that I could read upon and try to speed up further?I > > had tried a bit of block tiling but was not successful. > > > Thanks > > Arun > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to algogeeks@googlegroups.com. > > To unsubscribe from this group, send email to > > algogeeks+unsubscr...@googlegroups.com. > > 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
