Document Type
Conference Proceeding
Publication Date
1-1-2006
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. © Springer-Verlag Berlin Heidelberg 2006.
Publication Source (Journal or Book title)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
First Page
267
Last Page
275
Recommended Citation
Hartono, A., Lu, Q., Gao, X., Krishnamoorthy, S., Nooijen, M., Baumgartner, G., Bernholdt, D., Choppella, V., Pitzer, R., Ramanujam, J., Rountev, A., & Sadayappan, P. (2006). Identifying cost-effective common subexpressions to reduce operation count in tensor contraction evaluations. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3991 LNCS - I, 267-275. https://doi.org/10.1007/11758501_39