Volker Strassen is a Germanmathematician. He received in 2003, with three others, the Paris Kanellakis Award of the ACM, for work on randomised primality testing. A mathematician is a person whose area of study and research is mathematics. ... 2003 is a common year starting on Wednesday of the Gregorian calendar. ... The Association for Computing Machinery, or ACM, was founded in 1947 as the worlds first scientific and educational computing society. ... A primality test is an algorithm for determining whether an input number is prime. ...
In 1971 Strassen published a paper together with Arnold Schönhage on fast multiplication, see Schönhage-Strassen algorithm. He is also noted for developing, in 1969, an algorithm for fast matrix multiplication, now known as Strassen's algorithm. 1971 is a common year starting on Friday (click for link to calendar). ... Arnold Schönhage (born 1934) is a mathematician and computer scientist and Professor Emeritus at Rheinische Friedrich-Wilhelms-Universität, Bonn. ... In mathematics, the Schönhage-Strassen algorithm is an asympotically fast method for multiplication of large integer numbers. ... 1969 was a common year starting on Wednesday (the link is to a full 1969 calendar). ... This article gives an overview of the various ways to multiply matrices. ... In the mathematical discipline of linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm used for matrix multiplication. ...
In 1999 he was awarded the Cantor medal. 1999 is a common year starting on Friday of the Common Era, and was designated the International Year of Older Persons by the United Nations. ... The Cantor medal of the Deutsche Mathematiker-Vereinigung is named in honor of Georg Cantor. ...
In the mathematical discipline of linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm used for matrix multiplication. ...
External links
Homepage of Dr. Volker Strassen (http://www.mathe.uni-konstanz.de/mitarbeiter/strassen.html) (not valid any more; Strassens emailadress can be found here: http://www.math.uni-konstanz.de/Organisation/Personalverzeichnis#S)
In 1969, VolkerStrassen discovered an algorithm to multiply two n X n matrices in time O(n^(2.81)) instead of O(n^3) as is required by the standard algorithm.
The cross over point observed in the previous question convinced many people that Strassen's algorithm (Winograd's variant) was impractical; however, if a hybrid algorithm is used, where the regular algorithm is used when it is faster than applying Strassen's algorithm, then the cross over point is much smaller.
At each recursive step of Strassen's algorithm, if n is odd add an extra row and column of zeros so that A and B are embedded in (n+1) X (n+1) matrices A' and B'.
Feeds |
Contact