drnick
asked on
strassen's matrix multiplication algorithm
hi, does anyone know an implementation of strassen's matrix multiplication algorithm?
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
ASKER
you've earned yourself 120pts each,
and i put another 120 pts up for other ideas.
and i put another 120 pts up for other ideas.
SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
Thank you for accepting.
This keeps us answering your future questions too.
This keeps us answering your future questions too.
:-)
ASKER
??????
>> ??????
We all just say: "Thank you".
We all just say: "Thank you".
ASKER
you get your points, objects, no doubt.
however, i'm looking also for a more efficient implementation.
this one creates matrices for every variable it uses, while you can multiply strassen-like with less
than 7 new matrices every call. instead, i've heared, that it is possible with even constant memory consumption.
(let's say allocate 5*matrix size or such and such at the beginning)
i want this, because i fear that strassen's efficiency (fast multiplication)
is lost by too many memory operations.
but i didn't mention it, because wanted to see lots of other implementation.
so: i'm gonna increase the points every time i see a good solution, so i can split them and everyone is happy.