Related papers: Parallel Self-Consistent-Field Calculations via Ch…

This paper explores variants of the subspace iteration algorithm for computing approximate invariant subspaces. The standard subspace iteration approach is revisited and new variants that exploit gradient-type techniques combined with a…

We consider the problem of parallelizing electronic structure computations in plane-wave Density Functional Theory. Because of the limited scalability of Fourier transforms, parallelism has to be found at the eigensolver level. We show how…

DFT calculations have become widespread in both chemistry and materials, because they usually provide useful accuracy at much lower computational cost than wavefunction-based methods. All practical DFT calculations require an approximation…

Density-functional theory (DFT) has revolutionized computer simulations in chemistry and material science. A faithful implementation of the theory requires self-consistent calculations. However, this effort involves repeatedly diagonalizing…

The practical success of density functional theory (DFT) is largely credited to the Kohn-Sham approach, which enables the exact calculation of the non-interacting electron kinetic energy via an auxiliary noninteracting system. Yet, the…

The inverse problem of Kohn-Sham density functional theory (DFT) is often solved in an effort to benchmark and design approximate exchange-correlation potentials. The forward and inverse problems of DFT rely on the same equations but the…

Starting from a comparison of some established numerical algorithms for the computation of the eigenvalues (discrete or solitonic spectrum) of the non-Hermitian version of the Zakharov-Shabat spectral problem, this article delivers new…

As the second component of SPARC (Simulation Package for Ab-initio Real-space Calculations), we present an accurate and efficient finite-difference formulation and parallel implementation of Density Functional Theory (DFT) for extended…

In this paper, we propose a novel eigenpair-splitting method, inspired by the divide-and-conquer strategy, for solving the generalized eigenvalue problem arising from the Kohn-Sham equation. Unlike the commonly used domain decomposition…

Last year, at least 30,000 scientific papers used the Kohn-Sham scheme of density functional theory to solve electronic structure problems in a wide variety of scientific fields, ranging from materials science to biochemistry to…

A system of electrons in a local or nonlocal external potential can be studied with 1-matrix functional theory (1MFT), which is similar to density functional theory (DFT) but takes the one-particle reduced density matrix (1-matrix) instead…

While quantum computers have shown significant promise for electronic structure calculations, their potential to accelerate density functional theory (DFT) calculations remains unclear. In this work, we present a qubit-efficient encoding…

We re-adapt a spectral renormalization method, introduced in nonlinear optics, to solve the Kohn-Sham (KS) equations of density functional theory (DFT), with a focus on functionals based on the strictly-correlated electrons (SCE) regime,…

In this paper, a Parallel Direct Eigensolver for Sequences of Hermitian Eigenvalue Problems with no tridiagonalization is proposed, denoted by \texttt{PDESHEP}, and it combines direct methods with iterative methods. \texttt{PDESHEP} first…

We present the Tucker tensor DFT (TTDFT) code which uses a tensor-structured algorithm with graphic processing unit (GPU) acceleration for conducting ground-state DFT calculations on large-scale systems. The Tucker tensor DFT algorithm uses…

Starting from the observation that one of the most successful methods for solving the Kohn-Sham equations for periodic systems -- the plane-wave method -- is a spectral method based on eigenfunction expansion, we formulate a spectral method…

We present a multigrid algorithm for self consistent solution of the Kohn-Sham equations in real space. The entire problem is discretized on a real space mesh with a high order finite difference representation. The resulting self consistent…

We present the Fast Chebyshev Transform (FCT), a fast, randomized algorithm to compute a Chebyshev approximation of functions in high-dimensions from the knowledge of the location of its nonzero Chebyshev coefficients. Rather than sampling…

In \emph{Wang et al., A Shifted Laplace Rational Filter for Large-Scale Eigenvalue Problems}, the SLRF method was proposed to compute all eigenvalues of a symmetric definite generalized eigenvalue problem lying in an interval on the real…

The convergence property of a stochastic algorithm for the self-consistent field (SCF) calculations of electron structures is studied. The algorithm is formulated by rewriting the electron charges as a trace/diagonal of a matrix function,…