2006
DOI: 10.1002/jcc.20416
|View full text |Cite
|
Sign up to set email alerts
|

DIESEL‐MP2: A new program to perform large‐scale multireference‐MP2 computations

Abstract: This article presents a new MR-MP2 code (Multi-Reference Møller-Plesset 2nd order) suitable for the computation MR-MP2 energies of extended systems with strong near degeneracy effects (e.g., open shell systems). It is based on the DIESEL program package developed by Hanrath and Engels. Due to improved algorithms the new code is able to handle systems with 400-500 basis functions and more than 100 electrons. The code is made for parallel computers with distributed memory, but can also be run on local machines. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 45 publications
0
4
0
Order By: Relevance
“…The most iconic example of this move toward parallel-friendly methods is the recently developed full configuration interaction quantum Monte Carlo (FCIQMC) method by Alavi and co-workers . FCIQMC can be interpreted as a Monte Carlo equivalent of older selected configuration interaction (sCI) algorithms, ,, such as CIPSI (Configuration Interaction using a Perturbative Selection made Iteratively), that are iterative and thus a priori not well adapted to massively parallel architecture. As we see here, things turn out differently, and the focus of the present article is to show that sCI methods can be made efficient on modern massively parallel supercomputers.…”
Section: Introductionmentioning
confidence: 99%
“…The most iconic example of this move toward parallel-friendly methods is the recently developed full configuration interaction quantum Monte Carlo (FCIQMC) method by Alavi and co-workers . FCIQMC can be interpreted as a Monte Carlo equivalent of older selected configuration interaction (sCI) algorithms, ,, such as CIPSI (Configuration Interaction using a Perturbative Selection made Iteratively), that are iterative and thus a priori not well adapted to massively parallel architecture. As we see here, things turn out differently, and the focus of the present article is to show that sCI methods can be made efficient on modern massively parallel supercomputers.…”
Section: Introductionmentioning
confidence: 99%
“…The barycentric approximation simplifies the problem, avoiding the solution of large-scale linear equation systems. , In the Epstein-Nesbet partition, the unperturbed Hamiltonian is conveniently defined through a diagonal projected Hamiltonian so that both the CI states and the CSFs belonging to the FOIS are eigenvectors of H 0 EN . Although in the above equation the sum over K is formally on all the eigenvalues of the projected Hamiltonian, in practical cases the sum can be restricted to the computed zero-order states.…”
Section: Theoretical Background and Technical Aspectsmentioning
confidence: 99%
“…The barycentric approximation simplifies the problem, avoiding the solution of large-scale linear equation systems. 31,32 In the Epstein-Nesbet partition, the unperturbed Hamiltonian is conveniently defined through a diagonal projected Hamiltonian…”
Section: ■ Introductionmentioning
confidence: 99%
“…Some authors 30,39 make explicit their design decision to target problems with a certain number of atoms and basis functions, and from that derive which data structures can be replicated on each node and which must be distributed. Some 38,39,36,42 build in the capability to store certain data structures on disk, as was customary for serial implementations. On clusters of PCs, where each node has a local disk, this works quite well, but on high-end systems, like the SP4, with a parallel file system, like GPFS, the resulting I/O can cause a performance bottleneck.…”
Section: Review Of Parallel Implementationsmentioning
confidence: 99%