Presentation is loading. Please wait.

Presentation is loading. Please wait.

Linear scaling fundamentals and algorithms José M. Soler Universidad Autónoma de Madrid.

Similar presentations


Presentation on theme: "Linear scaling fundamentals and algorithms José M. Soler Universidad Autónoma de Madrid."— Presentation transcript:

1 Linear scaling fundamentals and algorithms José M. Soler Universidad Autónoma de Madrid

2 Linear scaling = Order(N) N (# atoms) CPU load ~ 100 Early 90’s ~ N 3

3 Order-N DFT 1.Find density and hamiltonian (80% of code) 2.Find “eigenvectors” and energy (20% of code) 3.Iterate SCF loop Steps 1 and 3 spared in tight-binding schemes

4 DFT: successful but heavy 3 Computational load ~ N Computationally much more expensive than empirical atomic simulations Several hundred atoms in massively parallel supercomputers

5 Key to O(N): locality ``Divide and conquer’’ W. Yang, Phys. Rev. Lett. 66, 1438 (1992) ``Nearsightedness’’ W. Kohn, Phys. Rev. Lett. 76, 3168 (1996) Large system

6 Basis sets for linear-scaling DFT LCAO: - Gaussian based + QC machinery G. Scuseria (GAUSSIAN), M. Head-Gordon (Q-CHEM) - Numerical atomic orbitals (NAO) SIESTA S. Kenny &. A Horsfield (PLATO) - Gaussian with hybrid machinery J. Hutter, M. Parrinello Bessel functions in ovelapping spheres P. Haynes & M. Payne B-splines in 3D grid D. Bowler & M. Gillan Finite-differences (nearly O(N)) J. Bernholc

7 Divide and conquer buffer central buffer b c b x x’ central buffer Weitao Yang (1992)

8 Fermi operator/projector Goedecker & Colombo (1994) f(E) = 1/(1+e E/kT )   n c n E n F   c n H n E tot = Tr[ F H ] ^^ ^ E min E F E max 1 0

9 Density matrix functional -0.5 0 1 1.5 1 0    Li, Nunes & Vanderbilt (1993)   = 3  2  - 2  3  E tot (   ) =     H  = min  

10 Wannier O(N) functional Mauri, Galli & Car, PRB 47, 9973 (1993) Ordejon et al, PRB 48, 14646 (1993) S ij = |  ’ k > =  j |  j > S jk -1/2 E KS =  k =  ijk S ki -1/2 S jk -1/2 = Tr[ S -1 H ] Kohn-Sham E O(N) = Tr[ (2I-S) H ] Order-N ^ ^

11 Order-N vs KS functionals O(N) KS Non-orthogonality penalty S ij =  ij  E O(N) = E KS

12 Chemical potential Kim, Mauri & Galli, PRB 52, 1640 (1995)  (r) = 2  ij  i (r) (2  ij -S ij )  j (r) E O(N) = Tr[ (2I-S) H ] # states = # electron pairs  Local minima E KMG = Tr[ (2I-S) (H-  S) ] # states > # electron pairs  = chemical potential (Fermi energy) E i <   |  i |  0 E i >   |  i |  1 Difficulties Solutions Stability of N(  ) Initial diagonalization First minimization of E KMG Reuse previous solutions

13 Orbital localization  ii RcRc rcrc  i (r) =   c i    (r)

14 Convergence with localisation radius R c (Ang) Relative Error (%) Si supercell, 512 atoms

15 Sparse vectors and matrices 2.127 1.853 5.372 xi 0 2.12 0 0 0 1.85 5.37 0 1.158 3.144 8.293 yi 8.29  1.85 = 15.34 3.14  0 = 0 1.15  0 = 0 ------- Sum 15.34 x Restore to zero x i  0 only

16 Actual linear scaling Single Pentium III 800 MHz. 1 Gb RAM c-Si supercells, single-  132.000 atoms in 64 nodes


Download ppt "Linear scaling fundamentals and algorithms José M. Soler Universidad Autónoma de Madrid."

Similar presentations


Ads by Google