Efficient electronic structure theory via hierarchical scale-adaptive coupled-cluster formalism: I. Theory and computational complexity analysis

A novel reduced-scaling, general-order coupled-cluster approach is formulated by exploiting hierarchical representations of many-body tensors, combined with the recently suggested formalism of scale-adaptive tensor algebra. Inspired by the hierarchical techniques from the renormalisation group appro...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Molecular physics Ročník 116; číslo 5-6; s. 588 - 601
Hlavný autor: Lyakh, Dmitry I.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Abingdon Taylor & Francis 19.03.2018
Taylor & Francis Ltd
Predmet:
CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS
Clusters
Coarsening
Complexity
Computation
Computer simulation
coupled-cluster
Electronic structure
Euclidean geometry
Floating point arithmetic
Floating structures
Formalism
Hierarchical tensor
linear scaling
Many body interactions
Mathematical analysis
MATHEMATICS AND COMPUTING
Matrix algebra
Scaling
Structural hierarchy
Tensors
ISSN:0026-8976, 1362-3028
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A novel reduced-scaling, general-order coupled-cluster approach is formulated by exploiting hierarchical representations of many-body tensors, combined with the recently suggested formalism of scale-adaptive tensor algebra. Inspired by the hierarchical techniques from the renormalisation group approach, H/H 2 -matrix algebra and fast multipole method, the computational scaling reduction in our formalism is achieved via coarsening of quantum many-body interactions at larger interaction scales, thus imposing a hierarchical structure on many-body tensors of coupled-cluster theory. In our approach, the interaction scale can be defined on any appropriate Euclidean domain (spatial domain, momentum-space domain, energy domain, etc.). We show that the hierarchically resolved many-body tensors can reduce the storage requirements to O(N), where N is the number of simulated quantum particles. Subsequently, we prove that any connected many-body diagram consisting of a finite number of arbitrary-order tensors, e.g. an arbitrary coupled-cluster diagram, can be evaluated in O(NlogN) floating-point operations. On top of that, we suggest an additional approximation to further reduce the computational complexity of higher order coupled-cluster equations, i.e. equations involving higher than double excitations, which otherwise would introduce a large prefactor into formal O(NlogN) scaling.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
USDOE Office of Science (SC)
AC05-00OR22725
ISSN:0026-8976
1362-3028
DOI:10.1080/00268976.2017.1367856