𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An implementation of RI–SCF on parallel computers

✍ Scribed by Herbert A. Früchtl; Rick A. Kendall; Robert J. Harrison; Kenneth G. Dyall


Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
153 KB
Volume
64
Category
Article
ISSN
0020-7608

No coin nor oath required. For personal study only.

✦ Synopsis


The resolution of the identity RI approximation to the Hartree᎐Fock method was implemented within the NWChem suite of ab initio programs for parallel computers. After a description of the method, a detailed account of the implementation is given. We present a sample calculation and compare its performance and accuracy to an ''exact'' direct SCF calculation. Problems and limitations of the method are also discussed.


📜 SIMILAR VOLUMES


Parallel implementation of a ray tracing
✍ Lee, Tong-Yee; Raghavendra, C. S.; Nicholas, John B. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 3 views

Ray tracing is a well known technique to generate life-like images. Unfortunately, ray tracing complex scenes can require large amounts of CPU time and memory storage. Distributed memory parallel computers with large memory capacities and high processing speeds are ideal candidates to perform ray tr

Large-scale correlated electronic struct
✍ David E. Bernholdt; Robert J. Harrison 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 630 KB

The approximate 'resolution of the identity' second-order many-body perturbation theory method (RI-MP2) recently introduced by Feyereisen, Fitzgerald and Komornicki utilizes a combination of two-and three-center integrals to approximate the usual four-center two-electron repulsion integrals. Like th

A coarse-grain parallel implementation o
✍ Hans P. Lüthi; John E. Mertz; Martin W. Feyereisen; Jan E. Almlöf 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 475 KB

A coarse-grain, parallel approach to direct Hartree-Fock calculations is presented and discussed. The suggested scheme allows for a near asymptotic speedup involving a very low parallelization overhead without compromising the vector performance of vector-parallel architectures. A shared-memory MIMD

Implementation of a Numerical Solution o
✍ Tamir G. Reisin; Sabine C. Wurzler 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 779 KB

Two different numerical solutions of the two-component kinetic collection equation were implemented on parallel computers. The parallelization approach included domain decomposition and MPI commands for communications. Four different parallel codes were tested. A dynamic decomposition based on an oc

Software for parallel computing: the LAM
✍ Christopher A. Swann 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

## Abstract Many econometric problems can benefit from the application of parallel computing techniques, and recent advances in hardware and software have made such application feasible. There are a number of freely available software libraries that make it possible to write message passing paralle