readme

C++编写的高性能矩阵乘法的Stranssen算法

    These directories contains the code for the SERIAL Strassen implementation
    for general matrix multiplication C = alpha*AB+beta*C.  The major
    difference between this code and the BLAS DGEMM routine is that
    Strassen uses more memory, but takes fewer operations.  The extra
    memory is malloced during the recursion process.  The amount depends on
    the number of recursions done. This is the first in a series of
    Strassen codes that will be released.  

    See the COPYRIGHT notice in the /doc directory.  It contains the
    copyright and disclaimer notice.

    Refer to the DGEFMM User's Guide contained in file /doc/UsersGuide.ps
    for more information about compiling, testing, and running the
    Strassen code.

    Feel free to send questions, comments, and problem reports
    to [e-mail].