Implementation and applications of Gaussian 82 on a CDC Cyber 205
β Scribed by Arvi Rauk; Remo Dutler
- Publisher
- John Wiley and Sons
- Year
- 1987
- Tongue
- English
- Weight
- 809 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0192-8651
No coin nor oath required. For personal study only.
β¦ Synopsis
The implementation of the GAUSSIAN 82 system of quantum chemistry codes on the CDC Cyber 205 supercomputer required approximately 1% man years of effort. Idiosyncracies of the Cyber 205 architecture, operating system, and compiler in so far as they affect the conversion and operation of large quantum chemistry codes on the machine are described. While advantage has not been taken of the powerful vector processor, the high intrinsic speed of the scalar processor and the large virtual storage capacity of the Cyber 205 make it a very powerful research tool for computational chemistry. The impact of the GAUSSIAN 82/Cyber 205 combination on computational chemistry research at the University of Calgary is illustrated by brief descriptions of a range of applications from highly accurate calculations on small systems to semiempirical studies of large molecular aggregates. Complete geometry optimizations and harmonic frequency analyses, for the most part, have become routine.
CYBER 205 SYSTEM CONFIGURATION
The major components of the Cyber 205 are the Central Processing Unit (CPU), the Central Memory, and the Maintenance Control Unit (MCU).2
π SIMILAR VOLUMES
The CGTO integral evaluation, SCF, SCF-gradient, integral transformation, and MR-CI (SD) steps of the COLUMBUS system of programs have been adapted for the CYBER 205. A description is given of our efforts and the partly heavy modifications necessary to exploit the potential of this supercomputer and
Majumdar (1994, J. Multivariate Anal. 48 87-106) compounds (in the sense of Robbins. 1951, "Proceedings, Second Berkeley Sympos. Math. Statist. Probab.," pp. 131-148, Univ. of California Press, Berkeley) the estimation problem in the mean-parameter family of Gaussian distributions on a real separabl
An implementation of the Kohn-Sham procedure with orbitals expanded in a Gaussian-type basis is presented. It has been built into the direct-SCF program of a TURBOMOLE package, from which it inherits the ability to exploit all finite point groups. While the one-electron and Coulomb part of the probl
We consider a parallel tree contraction scheme which in each contraction phase Ε½ . Ε½ . removes leaves and nodes in the maximal chains. Let T n and P n denote the time and processor complexity required to compute the all nearest smaller values Ε½ . ANSV and the minimum of n values for input elements d