Related papers: Low-Scaling Algorithm for the Random Phase Approxi…
We present an embedding approach to treat local electron correlation effects in periodic environments. In a single, consistent framework, our plane-wave based scheme embeds a local high-level correlation calculation (here Coupled Cluster…
Developing theoretical understanding of complex reactions and processes at interfaces requires using methods that go beyond semilocal density functional theory to accurately describe the interactions between solvent, reactants and…
We present an optimized random phase approximation method (optRPA26) that significantly improves upon conventional RPA. The method employs an empirically constructed hybrid functional to generate DFT orbitals to evaluate the RPA correlation…
We propose a practical method to solve the random-phase approximation (RPA) in the self-consistent Hartree-Fock (HF) and density-functional theory. The method is based on numerical evaluation of the residual interactions utilizing finite…
We recently introduced an efficient methodology to perform density-corrected Hartree-Fock density functional theory (DC(HF)-DFT) calculations and an extension to it we called "corrected" HF DFT (C(HF)-DFT). In this work, we take a further…
In this thesis are shown developments in the random phase approximation (RPA) in the context of range-separated theories. We present advances in the formalism of the RPA in general, and particularly in the "dielectric matrix" formulation of…
One popular way to compute the CANDECOMP/PARAFAC (CP) decomposition of a tensor is to transform the problem into a sequence of overdetermined least squares subproblems with Khatri-Rao product (KRP) structure involving factor matrices. In…
Robust Principal Component Analysis (RPCA) is a fundamental technique for decomposing data into low-rank and sparse components, which plays a critical role for applications such as image processing and anomaly detection. Traditional RPCA…
This paper studies the Tensor Robust Principal Component (TRPCA) problem which extends the known Robust PCA (Candes et al. 2011) to the tensor case. Our model is based on a new tensor Singular Value Decomposition (t-SVD) (Kilmer and Martin…
The random-phase approximation with second-order screened exchange (RPA+SOSEX) is a model of electron correlation energy with two caveats: its accuracy depends on an arbitrary choice of mean field, and it scales as $\mathcal{O}(n^5)$…
The random-phase approximation to the ground state correlation energy (RPA) in combination with exact exchange (EX) has brought Kohn-Sham (KS) density functional theory one step closer towards a universal, "general purpose first principles…
We introduce a novel algorithm that computes the $k$-sparse principal component of a positive semidefinite matrix $A$. Our algorithm is combinatorial and operates by examining a discrete set of special vectors lying in a low-dimensional…
LibRPA is a software package designed for efficient calculations of random phase approximation (RPA) electron correlation energies from first principles using numerical atomic orbital (NAOs). Leveraging a localized resolution of identity…
Tensor ring (TR) decomposition is a simple but effective tensor network for analyzing and interpreting latent patterns of tensors. In this work, we propose a doubly randomized optimization framework for computing TR decomposition. It can be…
Currently, existing tensor recovery methods fail to recognize the impact of tensor scale variations on their structural characteristics. Furthermore, existing studies face prohibitive computational costs when dealing with large-scale…
Recently, flow-based methods have achieved promising success in video frame interpolation. However, electron microscopic (EM) images suffer from unstable image quality, low PSNR, and disorderly deformation. Existing flow-based interpolation…
The Random Phase Approximation (RPA) for total energies has previously been shown to provide a qualitatively correct description of static correlation in molecular systems, where density functional theory (DFT) with local functionals are…
The problem of recovering a low $n$-rank tensor is an extension of sparse recovery problem from the low dimensional space (matrix space) to the high dimensional space (tensor space) and has many applications in computer vision and graphics…
Low-rank Tucker and CP tensor decompositions are powerful tools in data analytics. The widely used alternating least squares (ALS) method, which solves a sequence of over-determined least squares subproblems, is costly for large and sparse…
Random Phase Approximation (RPA) is the theory most commonly used to describe the excitations of many-body systems. In this article, the secular equations of the theory are obtained by using three different approaches: the equation of…