Recent advances in computing allow taking new look at matrix multiplication, where the key ideas are: decreasing interest in recursion, development of processors with thousands (potentially millions) of processing units, and influences from the Algebraic Path Problems. In this context, we propose a generalized matrix-matrix multiply-add (MMA) operation and illustrate its usability. Furthermore, we elaborate the interrelation between this generalization and the BLAS standard. © 2012 Springer-Verlag.
CITATION STYLE
Sedukhin, S. G., & Paprzycki, M. (2012). Generalizing matrix multiplication for efficient computations on modern computers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7203 LNCS, pp. 225–234). https://doi.org/10.1007/978-3-642-31464-3_23
Mendeley helps you to discover research relevant for your work.