An Optimized Sparse Approximate Matrix Multiply
Preprint
Abstract
We present an optimized single-precision implementation of the Sparse Approximate Matrix Multiply (\SpAMM{}) [M. Challacombe and N. Bock, arXiv {\bf 1011.3534} (2010)], a fast algorithm for matrix-matrix multiplication for matrices with decay that achieves an $\mathcal{O} (n \ln n)$ computational complexity with respect to matrix dimension $n$. We find that the max norm of the error matrix achieved with a \SpAMM{} tolerance of below $2 \times 10^{-8}$ is lower than that of the single-precision {\tt SGEMM} for quantum chemical test matrices, while outperforming {\tt SGEMM} with a cross-over already for small matrices ($n \sim 1000$). Relative to naive implementations of \SpAMM{} using optimized versions of {\tt SGEMM}, such as those found in Intel's Math Kernel Library ({\tt MKL}) or AMD's Core Math Library ({\tt ACML}), our optimized version is found to be significantly faster. Detailed performance comparisons are made with for quantum chemical matrices of RHF/STO-2G and RHF/6-31G${}^{**}$ water clusters.
Keywords
All Related Versions
This publication has 3 references indexed in Scilit:
- Iterative spatial joinACM Transactions on Database Systems, 2003
- Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for Free2000
- The rapid evaluation of potential fields in three dimensions1988