Improving the performance of tensor matrix vector multiplication in cumulative reaction probability based quantum chemistry codes

Dinesh Kaushik, William Gropp, Michael Minkoff, Barry Smith

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationHigh Performance Computing - HiPC 2008 - 15th International Conference, Proceedings
PublisherSpringer
Pages120-130
Number of pages11
ISBN (Print)354089893X, 9783540898931
DOIs
StatePublished - 2008
Event15th International Conference on High Performance Computing, HiPC 2008 - Bangalore, India
Duration: Dec 17 2008Dec 20 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5374 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other15th International Conference on High Performance Computing, HiPC 2008
Country/TerritoryIndia
CityBangalore
Period12/17/0812/20/08

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Improving the performance of tensor matrix vector multiplication in cumulative reaction probability based quantum chemistry codes'. Together they form a unique fingerprint.

Cite this