language agnostic - Strassen's Algorithm proof -
i have been reading strassen algorithm matrix multiplication.
as mentioned in introduction algorithms cormen , algorithm not intuitive. curious know if there exists rigorous mathematical proof of algorithm , went design of algorithm.
i tried searching on google , stackoverflow, links on comparing strassen's approach standard matrix multiplication approach or elaborate on procedure presented algorithm.
you should go source material. in case, original paper strassen:
strassen, volker, gaussian elimination not optimal, numer. math. 13, p. 354-356, 1969
http://link.springer.com/article/10.1007%2fbf02165411?li=true
even though haven't read myself, assume there rigorous discussion , proof of complexity of algorithm.
it looks professor strassen still active (http://en.wikipedia.org/wiki/volker_strassen) , has home page (http://www.math.uni-konstanz.de/~strassen/). if, after learning as can algorithm, still interested in learning more, don't think worded email professor out of question.
unfortunately, there not seem free version of paper available online despite fact work completed @ public university (uc berkeley) using federal funds (nsf grant), separate issue shouldn't discuss here.
if student, have access via school, or @ least school copy without cost you. luck.
Comments
Post a Comment