Numerical Linear Algebra

Efficiently Parallelizable Strassen-Based Multiplication of a Matrix by its Transpose
This repository contains the code related to the article Efficiently Parallelizable Strassen-Based Multiplication of a Matrix by its Transpose (V. Arrigoni, F. Maggioli, A. Massini, E. Rodolà).
Last updated on Feb 8, 2023
Efficiently Parallelizable Strassen-Based Multiplication of a Matrix by its Transpose
Efficiently parallelizable strassen-based multiplication of a matrix by its transpose
An efficient algorithm for computing the multiplication of a matrix by its transpose, exploiting Strassen-like recursions. The algorithm is designed to be parallelized with multiple paradigms, from multi-threading to distributed computing.
Cite PDF GitHub
Efficiently parallelizable strassen-based multiplication of a matrix by its transpose