An efficient matrix-matrix multiplication based antisymmetric tensor contraction engine for general order coupled cluster

  • Hanrath M
  • Engels-Putzka A
  • 21


    Mendeley users who have this article in their library.
  • 16


    Citations of this article.


In this paper, we present an efficient implementation of general tensor contractions, which is part of a new coupled-cluster program. The tensor contractions, used to evaluate the residuals in each coupled-cluster iteration are particularly important for the performance of the program. We developed a generic procedure, which carries out contractions of two tensors irrespective of their explicit structure. It can handle coupled-cluster-type expressions of arbitrary excitation level. To make the contraction efficient without loosing flexibility, we use a three-step procedure. First, the data contained in the tensors are rearranged into matrices, then a matrix-matrix multiplication is performed, and finally the result is backtransformed to a tensor. The current implementation is significantly more efficient than previous ones capable of treating arbitrary high excitations.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Michael Hanrath

  • Anna Engels-Putzka

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free