Improving the performance of tensor matrix vector multiplication in quantum chemistry codes.
Cumulative reaction probability (CRP) calculations provide a viable computational approach to estimate reaction rate coefficients. However, in order to give meaningful results these calculations should be done in many dimensions (ten to fifteen). This makes CRP codes memory intensive. For this reason, these codes use iterative methods to solve the linear systems, where a good fraction of the execution time is spent on matrix-vector multiplication. In this paper, we discuss the tensor product form of applying the system operator on a vector. This approach shows much better performance and provides huge savings in memory as compared to the explicit sparse representation of the system matrix.
- Research Organization:
- Argonne National Laboratory (ANL)
- Sponsoring Organization:
- SC
- DOE Contract Number:
- AC02-06CH11357
- OSTI ID:
- 928654
- Report Number(s):
- ANL/MCS-TM-297
- Country of Publication:
- United States
- Language:
- ENGLISH
Similar Records
Parallel sparse matrix vector multiplication using a shared virtual memory environment
Optimizing Sparse Matrix-Multiple Vectors Multiplication for Nuclear Configuration Interaction Calculations
Sparse Binary Matrix-Vector Multiplication on Neuromorphic Computers
Conference
·
Thu Dec 30 23:00:00 EST 1993
·
OSTI ID:54436
Optimizing Sparse Matrix-Multiple Vectors Multiplication for Nuclear Configuration Interaction Calculations
Conference
·
Thu Aug 14 00:00:00 EDT 2014
·
OSTI ID:1407214
Sparse Binary Matrix-Vector Multiplication on Neuromorphic Computers
Conference
·
Tue Jun 01 00:00:00 EDT 2021
·
OSTI ID:1814336