Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThree real-space discretization techniques in electronic structure calculations
333
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A characteristic feature of the state-of-the-art of real-space methods in electronic structure calculations is the diversity of the techniques used in the discretization of the relevant partial differential equations. In this context, the main approaches include finite-difference methods, various types of finite-elements and wavelets. This paper reports on the results of several code development projects that approach problems related to the electronic structure using these three different discretization methods. We review the ideas behind these methods, give examples of their applications, and discuss their similarities and differences.
rate research
Read More
We present a real-space adaptive-coordinate method, which combines the advantages of the finite-difference approach with the accuracy and flexibility of the adaptive coordinate method. The discretized Kohn-Sham equations are written in generalized curvilinear coordinates and solved self-consistently by means of an iterative approach. The Poisson equation is solved in real space using the Multigrid algorithm. We implemented the method on a massively parallel computer, and applied it to the calculation of the equilibrium geometry and harmonic vibrational frequencies of the CO_2, CO, N_2 and F_2 molecules, yielding excellent agreement with the results of accurate quantum chemistry and Local Density Functional calculations.
In this work we present RESCU, a powerful MATLAB-based Kohn-Sham density functional theory (KS-DFT) solver. We demonstrate that RESCU can compute the electronic structure properties of systems comprising many thousands of atoms using modest computer resources, e.g. 16 to 256 cores. Its computational efficiency is achieved from exploiting four routes. First, we use numerical atomic orbital (NAO) techniques to efficiently generate a good quality initial subspace which is crucially required by Chebyshev filtering methods. Second, we exploit the fact that only a subspace spanning the occupied Kohn-Sham states is required, and solving accurately the KS equation using eigensolvers can generally be avoided. Third, by judiciously analyzing and optimizing various parts of the procedure in RESCU, we delay the $O(N^3)$ scaling to large $N$, and our tests show that RESCU scales consistently as $O(N^{2.3})$ from a few hundred atoms to more than 5,000 atoms when using a real space grid discretization. The scaling is better or comparable in a NAO basis up to the 14,000 atoms level. Fourth, we exploit various numerical algorithms and, in particular, we introduce a partial Rayleigh-Ritz algorithm to achieve efficiency gains for systems comprising more than 10,000 electrons. We demonstrate the power of RESCU in solving KS-DFT problems using many examples running on 16, 64 and/or 256 cores: a 5,832 Si atoms supercell; a 8,788 Al atoms supercell; a 5,324 Cu atoms supercell and a small DNA molecule submerged in 1,713 water molecules for a total 5,399 atoms. The KS-DFT is entirely converged in a few hours in all cases. Our results suggest that the RESCU method has reached a milestone of solving thousands of atoms by KS-DFT on a modest computer cluster.
Linear scaling methods, or O(N) methods, have computational and memory requirements which scale linearly with the number of atoms in the system, N, in contrast to standard approaches which scale with the cube of the number of atoms. These methods, which rely on the short-ranged nature of electronic structure, will allow accurate, ab initio simulations of systems of unprecedented size. The theory behind the locality of electronic structure is described and related to physical properties of systems to be modelled, along with a survey of recent developments in real-space methods which are important for efficient use of high performance computers. The linear scaling methods proposed to date can be divided into seven different areas, and the applicability, efficiency and advantages of the methods proposed in these areas is then discussed. The applications of linear scaling methods, as well as the implementations available as computer programs, are considered. Finally, the prospects for and the challenges facing linear scaling methods are discussed.
Electronic states are responsible for most material properties, including chemical bonds, electrical and thermal conductivity, as well as optical and magnetic properties. Experimentally, however, they remain mostly elusive. Here, we report the real-space mapping of selected transitions between p and d states on the {AA}ngstrom scale in bulk rutile (TiO2) using electron energy-loss spectrometry (EELS), revealing information on individual bonds between atoms. On the one hand, this enables the experimental verification of theoretical predictions about electronic states. On the other hand, it paves the way for directly investigating electronic states under conditions that are at the limit of the current capabilities of numerical simulations such as, e.g., the electronic states at defects, interfaces, and quantum dots.
A real-space formalism for density-functional perturbation theory (DFPT) is derived and applied for the computation of harmonic vibrational properties in molecules and solids. The practical implementation using numeric atom-centered orbitals as basis functions is demonstrated exemplarily for the all-electron Fritz Haber Institute ab initio molecular simulations (FHI-aims) package. The convergence of the calculations with respect to numerical parameters is carefully investigated and a systematic comparison with finite-difference approaches is performed both for finite (molecules) and extended (periodic) systems. Finally, the scaling tests and scalability tests on massively parallel computer systems demonstrate the computational efficiency.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
