The tree search problem is considered for optimizing the horizontal recurrence relation step, which is a three-dimensional recurrence relation used in generating two-electron integrals. By eliminating redundant work, it is possible to achieve 13%, 25%. 38% and 44% savings in floating point operation
✦ LIBER ✦
An efficient implementation of the full-CI method using an (n–2)-electron projection space
✍ Scribed by Robert J. Harrison; Sohrab Zarrabian
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 484 KB
- Volume
- 158
- Category
- Article
- ISSN
- 0009-2614
No coin nor oath required. For personal study only.
✦ Synopsis
The determinant full-C1 algorithm of Zarrabian, Sarma and Paldus (Chem. Phys. Letters 158 (1989) 183) has been Implemcnted for efficient operation on parallel vector computers. For few electrons (n) in many orhitals (m) and n,, determinants, the floating point operation count is M (ncIm2n2), dominated by matrix multiplication. Timings reported include 5.4 x 10' and 7.7~ 10' determinant calculations on oxygen and its anion in 5s4p3d2flg and 4s3p2dlf+spd basis sets respectively. Consideration is given to exact manipulation of CI expansions much larger than those used here.
📜 SIMILAR VOLUMES
An efficient method of implementing the
✍
Ungsik Ryu; Yoon Sup Lee; Roland Lindh
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 558 KB
An Efficient and General Method for the
✍
Anil Saini; Sanjay Kumar; Jagir S. Sandhu
📂
Article
📅
2006
🏛
John Wiley and Sons
⚖ 22 KB
👁 1 views
ChemInform Abstract: Acetals and Ethers.
✍
A. PIASECKI; B. BURCZYK; A. SOKOLOWSKI; U. KOTLEWSKA
📂
Article
📅
2010
🏛
John Wiley and Sons
⚖ 29 KB
👁 2 views