1998
DOI: 10.1002/(sici)1096-987x(19980715)19:9<1017::aid-jcc3>3.0.co;2-t
|View full text |Cite
|
Sign up to set email alerts
|

Parallel pseudospectral electronic structure: I. Hartree-Fock calculations

Abstract: We present an outline of the parallel implementation of our pseudospectral electronic structure program, Jaguar, including the algorithm and timings for the Hartree–Fock and analytic gradient portions of the program. We also present the parallel algorithm and timings for our Lanczos eigenvector refinement code and demonstrate that its performance is superior to the ScaLAPACK diagonalization routines. The overall efficiency of our code increases as the size of the calculation is increased, demonstrating actual … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
25
0

Year Published

1999
1999
2015
2015

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 19 publications
(25 citation statements)
references
References 23 publications
(14 reference statements)
0
25
0
Order By: Relevance
“…The parallel pseudo spectral algorithm has been described in our previous study, and we shall only present the basic idea without detailed elaboration. In PS algorithm, the Coulomb matrix ( J ) elements and the exchange matrix ( K ) elements are calculated via, Jij=false∑gQifalse(rgfalse)false∑μνρνμAμν|rgRjfalse(rgfalse) Kij=false∑gQifalse(rgfalse)false∑μνρνμAμj|rgRνfalse(rgfalse) where ρνμ is an element of the density matrix, Rjtrue(rgtrue) is the atomic basis function j evaluated at a grid point rg, Aμν|rg is a three‐center, one‐electron integral representing the field at rg due to the product of two atomic basis functions indexed by μ and ν, and Qitrue(rgtrue) is the least squares fitting operator given by, …”
Section: Parallel Implementationmentioning
confidence: 99%
“…The parallel pseudo spectral algorithm has been described in our previous study, and we shall only present the basic idea without detailed elaboration. In PS algorithm, the Coulomb matrix ( J ) elements and the exchange matrix ( K ) elements are calculated via, Jij=false∑gQifalse(rgfalse)false∑μνρνμAμν|rgRjfalse(rgfalse) Kij=false∑gQifalse(rgfalse)false∑μνρνμAμj|rgRνfalse(rgfalse) where ρνμ is an element of the density matrix, Rjtrue(rgtrue) is the atomic basis function j evaluated at a grid point rg, Aμν|rg is a three‐center, one‐electron integral representing the field at rg due to the product of two atomic basis functions indexed by μ and ν, and Qitrue(rgtrue) is the least squares fitting operator given by, …”
Section: Parallel Implementationmentioning
confidence: 99%
“…However, the cost of task sorting is not to be neglected, see Figure 3b. With the plain WS approach in the range from 128 to 2048 cores the scheduling overhead does not contribute much to the overall effort, slowly increasing from 0.1 to 1.2 s in calculations on Cu 10 . Yet, for the methods with CS, it is notably higher, rising from 10 to 141 s for CS1ST and from 42 to 352 s for CS1WS.…”
Section: Small Copper Clustersmentioning
confidence: 99%
“…In quantum chemistry calculations, many algorithms involve independent subtasks that in principle are easy to parallelize, but often are not equally compute‐intensive. To tackle these tasks, various parallelization strategies have been invoked …”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations