On practical algorithms for accelerated matrix multiplication (Q1183208)

The authors present several bilinear algorithms for fast matrix multiplication of \(n\times n\) matrices. The algorithms are superior to both the classical and Strassen's algorithm for moderate \(n\) \((n\geq 20)\). When these algorithms are used over finite fields the bilinear complexity decreases below the current record upper bound for the same computation over infinite fields. Numerical experiments are also reported.