Related papers: An approximation strategy to compute accurate init…
The spherical Hartree-Fock approximation is applied to the $abinitio$ no-core shell model, with a realistic effective nucleon-nucleon interaction in order to investigate the range of its utility. Hartree-Fock results for binding energies,…
For homogeneous initial conditions, Hartree (gaussian) dynamical approximations are known to have problems with thermalization, because of insufficient scattering. We attempt to improve on this by writing an arbitrary density matrix as a…
Few-electron systems confined in two-dimensional parabolic quantum dots at high magnetic fields are studied by the Hartree-Fock (HF) and exact diagonalization methods. A generalized multicenter Gaussian basis is proposed in the HF method. A…
We introduce a new sequential methodology to calibrate the fixed parameters and track the stochastic dynamical variables of a state-space system. The proposed method is based on the nested hybrid filtering (NHF) framework of [1], that…
We reframe linear dimensionality reduction as a problem of Bayesian inference on matrix manifolds. This natural paradigm extends the Bayesian framework to dimensionality reduction tasks in higher dimensions with simpler models at greater…
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…
We present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the…
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…
We describe a novel algorithm for solving general parametric (nonlinear) eigenvalue problems. Our method has two steps: first, high-accuracy solutions of non-parametric versions of the problem are gathered at some values of the parameters;…
We investigate numerically efficient approximations of eigenspaces associated to symmetric and general matrices. The eigenspaces are factored into a fixed number of fundamental components that can be efficiently manipulated (we consider…
We develop convergence acceleration procedures that enable a gradient descent-type iteration method to efficiently simulate Hartree--Fock equations for atoms interacting both with each other and with an external potential. Our development…
We propose a way of obtaining effective low energy Hubbard-like model Hamiltonians from ab initio Quantum Monte Carlo calculations for molecular and extended systems. The Hamiltonian parameters are fit to best match the ab initio two-body…
We develop and analyze stochastic inexact Gauss-Newton methods for nonlinear least-squares problems and for nonlinear systems ofequations. Random models are formed using suitable sampling strategies for the matrices involved in the…
The Hartree-Fock-Bogoliubov approximation is very useful for treating both long- and short-range correlations in finite quantum fermion systems, but it must be extended in order to describe detailed spectroscopic properties. One problem is…
Advancements in theoretical and algorithmic approaches, workflow engines, and an ever-increasing computational power have enabled a novel paradigm for materials discovery through first-principles high-throughput simulations. A major…
A new framework is presented for evaluating the performance of self-consistent field methods in Kohn-Sham density functional theory. The aims of this work are two-fold. First, we explore the properties of Kohn-Sham density functional theory…
Traditional numerical methods for calculating matrix eigenvalues are prohibitively expensive for high-dimensional problems. Iterative random sparsification methods allow for the estimation of a single dominant eigenvalue at reduced cost by…
Many algorithms for the computation of correspondences between deformable shapes rely on some variant of nearest neighbor matching in a descriptor space. Such are, for example, various point-wise correspondence recovery algorithms used as a…
The energy levels of the first few low-lying states of helium and lithium atoms in intense magnetic fields up to $\approx 10^8-10^9$~T are calculated in this study. A pseudospectral method is employed for the computational procedure. The…
A new scheme to study the properties of finite nuclei is proposed based on the Dirac-Brueckner-Hartree-Fock (DBHF) approach starting from a bare nucleon-nucleon interaction. The relativistic structure of the nucleon self-energies in nuclear…