Matrix black box algorithms - a survey

Abstract

The implementations of matrix multiplication on contemporary, vector-oriented, and multicore-oriented computer hardware are very carefully designed and optimized with respect to their efficiency, due to the essential significance of that operation in other science and engineering domains. Consequently, the available implementations are very fast and it is a natural desire to take advantage of the efficiency of those implementations in other problems, both matrix and nonmatrix. Such an approach is often called a black box matrix computation paradigm in the literature on the subject. In this article, we gathered a broad series of algorithms taking advantage of the efficiency of fast matrix multiplication algorithms in other mathematical and computer science operations.