2003
DOI: 10.1063/1.1590632
|View full text |Cite
|
Sign up to set email alerts
|

Improved Fermi operator expansion methods for fast electronic structure calculations

Abstract: Articles you may be interested inAtomic spectral methods for molecular electronic structure calculations Explicitly correlated divide-and-conquer-type electronic structure calculations based on two-electron reduced density matrices Linear scaling conjugate gradient density matrix search as an alternative to diagonalization for first principles electronic structure calculations Linear scaling algorithms based on Fermi operator expansions ͑FOE͒ have been considered significantly slower than other alternative app… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
96
0

Year Published

2005
2005
2016
2016

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 90 publications
(96 citation statements)
references
References 64 publications
(32 reference statements)
0
96
0
Order By: Relevance
“…The graph-based electronic structure theory combines the natural parallelism of a divide and conquer approach [12][13][14][15][16][17] with the automatically adaptive and tunable accuracy of a thresholded sparse matrix algebra, [18][19][20][21][22][23][24][25][26][27][28][29][30][31] which can be combined with fast, low pre-factor, recursive Fermi operator expansion methods [32][33][34][35][36][37][38][39][40][41] and can be applied to modern formulations of Born-Oppenheimer molecular dynamics. [42][43][44][45][46][47][48][49][50] The article is outlined as follows: first we introduce the graph-based formalism for general sparse matrix polynomials expanded over separate subgraphs, thereafter we apply the methodology to the Fermi-operator expansion in electronic structure theory with demonstrations for a protein-like structure of polyalanine solvated in water, before analyzing applications in molecular dynamics simulations.…”
Section: Introductionmentioning
confidence: 99%
“…The graph-based electronic structure theory combines the natural parallelism of a divide and conquer approach [12][13][14][15][16][17] with the automatically adaptive and tunable accuracy of a thresholded sparse matrix algebra, [18][19][20][21][22][23][24][25][26][27][28][29][30][31] which can be combined with fast, low pre-factor, recursive Fermi operator expansion methods [32][33][34][35][36][37][38][39][40][41] and can be applied to modern formulations of Born-Oppenheimer molecular dynamics. [42][43][44][45][46][47][48][49][50] The article is outlined as follows: first we introduce the graph-based formalism for general sparse matrix polynomials expanded over separate subgraphs, thereafter we apply the methodology to the Fermi-operator expansion in electronic structure theory with demonstrations for a protein-like structure of polyalanine solvated in water, before analyzing applications in molecular dynamics simulations.…”
Section: Introductionmentioning
confidence: 99%
“…To check the performance of our method, we calculate the HOMO and LUMO of BN (5,5) nanotubes with different number of atoms in the supercells. The CPU time used is shown in Fig.…”
Section: B Validity and Performance Of The O(n) Methods For Band Edgementioning
confidence: 99%
“…In the field of computational mathematics, the shift-and-invert Lanczos algorithm is a wellknown method for calculating a pair of eigenvalue and eigenvector near a reference energy. This method was used by Liang et al 5 to obtain the Fermi level in the context of linear scaling Fermi operator expansion method. In this method, the Lanczos method is applied to the socalled shift-and-invert matrix, (H − ǫ ref I) −1 , where H and I are the Hamiltonian and identity matrices, respectively, and ǫ ref is the reference energy.…”
Section: Introductionmentioning
confidence: 99%
“…[37][38][39][40][41][42][43][44][45][46][47] However, in contrast to schemes that are based on serial expansions, the recursive expansion in Eq. (42) leads to a very highorder approximation in only a few number of iteration steps.…”
Section: A T E ≥mentioning
confidence: 99%