TY - JOUR
N2 - 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.
L1 - http://journals.pan.pl/Content/122565/PDF/BPASTS_2022_70_2_1344.pdf
L2 - http://journals.pan.pl/Content/122565
PY - 2022
IS - 2
EP - e140535
DO - 10.24425/bpasts.2022.140535
KW - matrix algebra
KW - matrix multiplication algorithm
KW - numerical recipes
KW - recursion
A1 - Respondek, Jerzy
VL - 70
DA - 07.03.2022
T1 - Matrix black box algorithms - a survey
SP - e140535
UR - http://journals.pan.pl/dlibra/publication/edition/122565
T2 - Bulletin of the Polish Academy of Sciences Technical Sciences
ER -