@inproceedings{a4d8b142b723418eb3a61cc4f6d1f0be,
title = "Identifying cost-effective common subexpressions to reduce operation count in tensor contraction evaluations",
abstract = "Complex tensor contraction expressions arise in accurate electronic structure models in quantum chemistry, such as the coupled cluster method. Transformations using algebraic properties of commutativity and associativity can be used to significantly decrease the number of arithmetic operations required for evaluation of these expressions. Operation minimization is an important optimization step for the Tensor Contraction Engine, a tool being developed for the automatic transformation of high-level tensor contraction expressions into efficient programs. The identification of common subexpressions among a set of tensor contraction expressions can result in a reduction of the total number of operations required to evaluate the tensor contractions. In this paper, we develop an effective algorithm for common subexpression identification and demonstrate its effectiveness on tensor contraction expressions for coupled cluster equations.",
author = "Albert Hartono and Qingda Lu and Xiaoyang Gao and Sriram Krishnamoorthy and Marcel Nooijen and Gerald Baumgartner and Bernholdt, {David E.} and Venkatesh Choppella and Pitzer, {Russell M.} and J. Ramanujam and Atanas Rountev and P. Sadayappan",
year = "2006",
doi = "10.1007/11758501_39",
language = "English",
isbn = "3540343792",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "267--275",
booktitle = "Computational Science - ICCS 2006",
note = "ICCS 2006: 6th International Conference on Computational Science ; Conference date: 28-05-2006 Through 31-05-2006",
}