Interior state computation of nano structures

We are concerned with the computation of electronic and optical properties of quantum dots. Using the Energy SCAN (ESCAN) method with empirical pseudopotentials, we compute interior eigenstates around the band gap which determine their properties. Numerically, this interior Hermitian eigenvalue problem poses several challenges, both with respect to accuracy and efficiency. Using these criteria, we evaluate several state-of-the art preconditioned iterative eigensolvers on a range of CdSe quantum dots of various sizes. All the iterative eigensolvers are seeking for the minimal eigenvalues of the folded operator with reference shift in the band-gap. The tested methods include standard ConjugateGradient (CG)-based Rayleigh-Quotient minimization, Locally Optimal Block-Preconditioned CG (LOBPCG) and two variants of the Jacobi Davidson method: JDQMR and GD+1. Our experimental results conclude that the Jacobi Davidson method is often the fastest.

[1]  Massimiliano Di Ventra,et al.  Targeting specific eigenvectors and eigenvalues of a given Hamiltonian using arbitrary selection criteria , 2002 .

[2]  D. Sorensen.  Numerical methods for large eigenvalue problems , 2002, Acta Numerica.

[3]  Andrew V. Knyazev,et al.  Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method , 2001, SIAM J. Sci. Comput..

[4]  Lin-wang Wang,et al.  Parallel Empirical Pseudopotential Electronic Structure Calculations for Million Atom Systems , 2000 .

[5]  Jack Dongarra,et al.  Templates for the Solution of Algebraic Eigenvalue Problems , 2000, Software, environments, tools.

[6]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[7]  Y. Saad,et al.  Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue methods , 1998 .

[8]  Lin-wang Wang,et al.  Pseudopotential theory of nanometer silicon quantum dots , 1997 .

[9]  D. C. SORENSENy,et al.  Accelerating the Lanczos Algorithm via Polynomial Spectral Transformations , 1997 .

[10]  A. Edelman,et al.  On conjugate gradient-like methods for eigen-like problems , 1996 .

[11]  A. Stathopoulos,et al.  Solution of large eigenvalue problems in electronic structure calculations , 1996 .

[12]  A. Stathopoulos,et al.  A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix , 1994 .

[13]  Lin-wang Wang,et al.  Solving Schrödinger’s equation around a desired energy: Application to silicon quantum dots , 1994 .

[14]  T. Arias,et al.  Iterative minimization techniques for ab initio total energy calculations: molecular dynamics and co , 1992 .

[15]  P. Pulay.  Improved SCF convergence acceleration , 1982 .

[16]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .

[17]  E. Davidson.  The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices , 1975 .