## Abstract A new parallel algorithm has been developed for calculating the analytic energy derivatives of full accuracy second order Møller‐Plesset perturbation theory (MP2). Its main projected application is the optimization of geometries of large molecules, in which noncovalent interactions play
An efficient parallel algorithm for the calculation of canonical MP2 energies
✍ Scribed by Jon Baker; Peter Pulay
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 111 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0192-8651
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We present the parallel version of a previous serial algorithm for the efficient calculation of canonical MP2 energies (Pulay, P.; Saebo, S.; Wolinski, K. Chem Phys Lett 2001, 344, 543). It is based on the Saebo–Almlöf direct‐integral transformation, coupled with an efficient prescreening of the AO integrals. The parallel algorithm avoids synchronization delays by spawning a second set of slaves during the bin‐sort prior to the second half‐transformation. Results are presented for systems with up to 2000 basis functions. MP2 energies for molecules with 400–500 basis functions can be routinely calculated to microhartree accuracy on a small number of processors (6–8) in a matter of minutes with modern PC‐based parallel computers. © 2002 Wiley Periodicals, Inc. J Comput Chem 23: 1150–1156, 2002
📜 SIMILAR VOLUMES
## Abstract A new parallel algorithm has been developed for second‐order Møller–Plesset perturbation theory (MP2) energy calculations. Its main projected applications are for large molecules, for instance, for the calculation of dispersion interaction. Tests on a moderate number of processors (2–16
A parallel algorithm for efficient calculation of the second Ž . derivatives Hessian of the conformational energy in internal coordinates is proposed. This parallel algorithm is based on the masterrslave model. A master processor distributes the calculations of components of the Hessian to one or mo
The P 4 -tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with few induced P 4 (cographs, P 4 -sparse graphs, P 4 -lite graphs). Here, we propose an extension of R. Lin and S. Olariu's work (1994. J. Parallel Distributed Computing 22, 26 36.) on cographs, usi
In this paper an efficient parallel algorithm to solve a three-dimensional problem of subsidence above exploited gas reservoirs is presented. The parallel program is developed on a cluster of workstations. The parallel virtual machine (PVM) system is used to handle communications among networked wor