Related papers: TTDFT: A GPU accelerated Tucker tensor DFT code fo…

We discuss the application of graphical processing units (GPUs) to accelerate real-space density functional theory (DFT) calculations. To make our implementation efficient, we have developed a scheme to expose the data parallelism available…

We develop new approximation algorithms and data structures for representing and computing with multivariate functions using the functional tensor-train (FT), a continuous extension of the tensor-train (TT) decomposition. The FT represents…

Quantum mechanical calculations for material modelling using Kohn-Sham density functional theory (DFT) involve the solution of a nonlinear eigenvalue problem for $N$ smallest eigenvector-eigenvalue pairs with $N$ proportional to the number…

In this work, we develop an optimization framework for problems whose solutions are well-approximated by Hierarchical Tucker (HT) tensors, an efficient structured tensor format based on recursive subspace factorizations. By exploiting the…

We present INQ, a new implementation of density functional theory (DFT) and time-dependent DFT (TDDFT) written from scratch to work on graphical processing units (GPUs). Besides GPU support, INQ makes use of modern code design features and…

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…

We present an implementation of time-dependent density-functional theory (TDDFT) in the linear response formalism enabling the calculation of low energy optical absorption spectra for large molecules and nanostructures. The method avoids…

This paper proposes fast randomized algorithms for computing the Kronecker Tensor Decomposition (KTD). The proposed algorithms can decompose a given tensor into the KTD format much faster than the existing state-of-the-art algorithms. Our…

Ultra-fast electronic phenomena originating from finite temperature, such as nonlinear optical excitation, can be simulated with high fidelity via real-time time dependent density functional theory (rt-TDDFT) calculations with hybrid…

Efficient hybrid DFT simulations of solid state materials would be extremely beneficial for computational chemistry and materials science, but is presently bottlenecked by difficulties in computing Hartree-Fock (HF) exchange with plane wave…

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. We propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two…

Eigenvalue problems and linear systems of equations involving large symmetric matrices are commonly solved in quantum chemistry using Krylov space methods, such as the Davidson algorithm. The preconditioner is a key component of Krylov…

Hybrid density functional theory (DFT) remains intractable for large periodic systems due to the demanding computational cost of exact exchange. We apply the tensor hypercontraction (THC) (or interpolative separable density fitting)…

The increasing availability of GPUs for scientific computing has prompted interest in accelerating quantum chemical calculations through their use. The complexity of integral kernels for high angular momentum basis functions however often…

This chapter presents controlled approximations of Kohn-Sham density functional theory (DFT) that enable very large scale simulations. The work is motivated by the study of defects in crystalline solids, though the ideas can be used in…

Real-time time-dependent density functional theory (rt-TDDFT) with hybrid exchange-correlation functional has wide-ranging applications in chemistry and material science simulations. However, it can be thousands of times more expensive than…

Randomized numerical linear algebra is proved to bridge theoretical advancements to offer scalable solutions for approximating tensor decomposition. This paper introduces fast randomized algorithms for solving the fixed Tucker-rank problem…

Understanding many processes, e.g. fusion experiments, planetary interiors and dwarf stars, depends strongly on microscopic physics modeling of warm dense matter (WDM) and hot dense plasma. This complex state of matter consists of a…

The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing the computational complexity which was introduced by Wen and…

Time-dependent density functional theory (TDDFT) simulations of transient core-level spectroscopies require a balanced treatment of both valence- and core-electron excitations. To this end, tuned range-separated hybrid exchange-correlation…