1997
DOI: 10.1103/physrevb.55.15382
|View full text |Cite
|
Sign up to set email alerts
|

Kernel polynomial method for a nonorthogonal electronic-structure calculation of amorphous diamond

Abstract: The Kernel polynomial method ͑KPM͒ has been successfully applied to tight-binding electronic-structure calculations as an O(N) method. Here we extend this method to nonorthogonal basis sets with a sparse overlap matrix S and a sparse Hamiltonian H. Since the KPM method utilizes matrix vector multiplications it is necessary to apply S Ϫ1 H onto a vector. The multiplication of S Ϫ1 is performed using a preconditioned conjugate-gradient method and does not involve the explicit inversion of S. Hence the method sca… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
42
0

Year Published

1999
1999
2019
2019

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 101 publications
(42 citation statements)
references
References 15 publications
0
42
0
Order By: Relevance
“…Some of the techniques we use, based on the stochastic trace formula. 20 , have been developed for tight-binding electronic structure [21][22][23] , for molecular electronics 24 and for multi-exciton generation in nanocrsytals 25 . The success of sDFT in reducing the scaling comes at a price of introducing a stochastic error in all its predictions, including forces, and that precludes application to ab initio molecular dynamics.…”
Section: Introductionmentioning
confidence: 99%
“…Some of the techniques we use, based on the stochastic trace formula. 20 , have been developed for tight-binding electronic structure [21][22][23] , for molecular electronics 24 and for multi-exciton generation in nanocrsytals 25 . The success of sDFT in reducing the scaling comes at a price of introducing a stochastic error in all its predictions, including forces, and that precludes application to ab initio molecular dynamics.…”
Section: Introductionmentioning
confidence: 99%
“…This problem is especially relevant if the diagonalization of the overlap matrix is performed in real space and when one uses an overlap matrix which is necessarily approximate due to the finite cutoff imposed on the range of the matrix elements or due to the Slater-Koster two-center approximation used in parametrizing them. One commonly-used fix to this problem is to add a diagonal matrix with small elements to make the overlap matrix positive definite [81]. The orthogonal Laewdin hamiltonian matrix is obtained by sandwiching the original hamiltonian matrix with A matrices:…”
Section: Laewdin Orthogonalizationmentioning
confidence: 99%
“…Another notable approximation lies in the computation of the moments µ k . The sequence µ k is not readily available and can be only approximated [144,181]. The various methods proposed in the literature consist of using probabilistic arguments for this purpose.…”
Section: Use Of Orthogonal Polynomialsmentioning
confidence: 99%
“…There are, however, situations where the use of orthogonal polynomials can be very cost-effective. In [144] the density of states (DOS) is computed using this strategy. One starts with a density of eigenvalues in R n which in the form of a sum of Dirac functions:…”
Section: Use Of Orthogonal Polynomialsmentioning
confidence: 99%