Search

We propose a new approach towards approximating the density-to-pair-density map based on copula theory from statistics. We extend the copula theory to multi-dimensional marginals, and deduce that one can describe any (exact or approximate) pair density by the single-particle density and a copula. We present analytical formulas for the exact copula in scaling limits, numerically compute the copula for dissociating systems with two to four particles in one dimension, and propose accurate approximations of the copula between equilibrium and dissociation for two-particle systems.

This article compares the tensor method density matrix renormalization group (DMRG) with two neural network based methods -namely FermiNet and PauliNet) for determining the ground state wavefunction of the many-body electronic Schr{\"o}dinger problem. We provide numerical simulations illustrating the main features of the methods and showing convergence with respect to some parameter, such as the rank for DMRG, and number of pretraining iterations for neural networks. We then compare the obtained energy with the methods for a few atoms and molecules, for some of which the exact value of the energy is known for the sake of comparison. In the last part of the article, we propose a new kind of neural network to solve the Schr{\"o}dinger problem based on the training of the wavefunction on a simplex, and an explicit permutation for evaluating the wavefunction on the whole space. We provide numerical results on a toy problem for the sake of illustration.

We establish guaranteed and practically computable a posteriori error bounds for source problems and eigenvalue problems involving linear Schr{\"o}dinger operators with atom-centered potentials discretized with linear combinations of atomic orbitals. We show that the energy norm of the discretization error can be estimated by the dual energy norm of the residual, that further decomposes into atomic contributions, characterizing the error localized on atoms. Moreover, we show that the practical computation of the dual norms of atomic residuals involves diagonalizing radial Schr{\"o}dinger operators which can easily be precomputed in practice. We provide numerical illustrations of the performance of such a posteriori analysis on several test cases, showing that the error bounds accurately estimate the error, and that the localized error components allow for optimized adaptive basis sets.

In this article, we derive fully guaranteed error bounds for the energy of convex nonlinear mean-field models. These results apply in particular to Kohn-Sham equations with convex density functionals, which includes the reduced Hartree-Fock (rHF) model, as well as the Kohn-Sham model with exact exchange-density functional (which is unfortunately not explicit and therefore not usable in practice). We then decompose the obtained bounds into two parts, one depending on the chosen discretization and one depending on the number of iterations performed in the self-consistent algorithm used to solve the nonlinear eigenvalue problem, paving the way for adaptive refinement strategies. The accuracy of the bounds is demonstrated on a series of test cases, including a Silicon crystal and an Hydrogen Fluoride molecule simulated with the rHF model and discretized with planewaves. We also show that, although not anymore guaranteed, the error bounds remain very accurate for a Silicon crystal simulated with the Kohn-Sham model using nonconvex exchangecorrelation functionals of practical interest.

In the aim of reducing the computational cost of the resolution of parameter-dependent eigenvalue problems, a model order reduction (MOR) procedure is proposed. We focus on the case of non-self-adjoint generalized eigenvalue problems, such as the stationary multigroup neutron diffusion equations. The method lies in an approximation of the manifold of solutions using a Proper Orthogonal Decomposition approach. The numerical method is composed of two stages. In the offline stage, we build a reduced space which approximates the manifold. In the online stage, for any given new set of parameters, we solve a reduced problem on the reduced space within a much smaller computational time than the required time to solve the high-fidelity problem. This method is applied to core computations in the APOLLO3 code.

The aim of this article is to propose a new reduced-order modelling approach for parametric eigenvalue problems arising in electronic structure calculations. Namely, we develop nonlinear reduced basis techniques for the approximation of parametric eigenvalue problems inspired from quantum chemistry applications. More precisely, we consider here a one-dimensional model which is a toy model for the computation of the electronic ground state wavefunction of a system of electrons within a molecule, solution to the many-body electronic Schr\"odinger equation, where the varying parameters are the positions of the nuclei in the molecule. We estimate the decay rate of the Kolmogorov n-width of the set of solutions for this parametric problem in several settings, including the standard L2-norm as well as with distances based on optimal transport. The fact that the latter decays much faster than in the traditional L2-norm setting motivates us to propose a practical nonlinear reduced basis method, which is based on an offline greedy algorithm, and an efficient stochastic energy minimization in the online phase. We finally provide numerical results illustrating the capabilities of the method and good approximation properties, both in the offline and the online phase.

In this article, we propose a reduced basis method for parametrized non-symmetric eigenvalue problems arising in the loading pattern optimization of a nuclear core in neutronics. To this end, we derive a posteriori error estimates for the eigenvalue and left and right eigenvectors. The practical computation of these estimators requires the estimation of a constant called prefactor, which we can express as the spectral norm of some operator. We provide some elements of theoretical analysis which illustrate the link between the expression of the prefactor we obtain here and its well-known expression in the case of symmetric eigenvalue problems, either using the notion of numerical range of the operator, or via a perturbative analysis. Lastly, we propose a practical method in order to estimate this prefactor which yields interesting numerical results on actual test cases. We provide detailed numerical simulations on two-dimensional examples including a multigroup neutron diffusion equation.

This article proposes a so-called Quasi Time-Reversible (QTR G-Ext) scheme based on Grassmann extrapolation of density matrices for an accurate calculation of initial guesses in Born-Oppenheimer Molecular Dynamics simulations. The method shows excellent results on four large molecular systems, ranging from 21 to 94 atoms simulated with Kohn-Sham density functional theory surrounded with a classical environment with 6k to 16k atoms. Namely, it clearly reduces the number of self-consistent field iterations, while keeping a similar energy drift as in the extended Lagrangian Born-Oppenheimer method.

Standard perturbation theory of eigenvalue problems consists of obtaining approximations of eigenmodes in the neighborhood of a Hamiltonian where the corresponding eigenmode is known. Nevertheless, if the corresponding eigenmodes of several nearby Hamiltonians are known, standard perturbation theory cannot simultaneously use all this knowledge to provide a better approximation. We derive a formula enabling such an approximation result, and provide numerical examples for which this method is more competitive than standard perturbation theory.

In this article, we present an overview of different a posteriori error analysis and postprocessing methods proposed in the context of nonlinear eigenvalue problems, e.g. arising inelectronic structure calculations for the calculation of the ground state and compare them. Weprovide two equivalent error reconstructions based either on a second-order Taylor expansionof the minimized energy, or a first-order expansion of the nonlinear eigenvalue equation. Wethen show how several a posteriori error estimations as well as post-processing methods can beformulated as specific applications of the derived reconstructed errors, and we compare theirrange of applicability as well as numerical cost and precision.

In this article, we study Wasserstein-type metrics and corresponding barycenters for mixtures of a chosen subset of probability measures called atoms hereafter. In particular, this works extends what was proposed by Delon and Desolneux [A Wasserstein-Type Distance in the Space of Gaussian Mixture Models. SIAM J. Imaging Sci. 13, 936-970 (2020)] for mixtures of gaussian measures to other mixtures. We first prove in a general setting that for a set of atoms equipped with a metric that defines a geodesic space, the set of mixtures based on this set of atoms is also geodesic space for the defined modified Wasserstein metric. We then focus on two particular cases of sets of atoms: (i) the set of location-scatter atoms and (ii) the set of measures that are invariant with respect to some symmetry group. Both cases are particularly relevant for various applications among which electronic structure calculations. Along the way, we also prove some sparsity and symmetry properties of optimal transport plans between measures that are invariant under some well-chosen symmetries.

In this article, we propose general criteria to construct optimal atomic centered basis sets in quantum chemistry. We focus in particular on two criteria, one based on the ground-state one-body density matrix of the system and the other based on the ground-state energy. The performance of these two criteria are then numerically tested and compared on a parametrized eigenvalue problem, which corresponds to a one-dimensional toy version of the ground-state dissociation of a diatomic molecule.

We propose a scheme to construct predictive models for Hamiltonian matrices in atomic orbital representation from ab initio data as a function of atomic and bond environments. The scheme goes beyond conventional tight binding descriptions as it represents the ab initio model to full order, rather than in two-centre or three-centre approximations. We achieve this by introducing an extension to the Atomic Cluster Expansion (ACE) descriptor that represents Hamiltonian matrix blocks that transform equivariantly with respect to the full rotation group. The approach produces analytical linear models for the Hamiltonian and overlap matrices. Through an application to aluminium, we demonstrate that it is possible to train models from a handful of structures computed with density functional theory, and apply them to produce accurate predictions for the electronic structure. The model generalises well and is able to predict defects accurately from only bulk training data., Comment: 15 pages, 9 figures; included vacancy PDOS and restricted FCC or BCC training sets

We propose accurate computable error bounds for quantities of interest in plane-wave electronic structure calculations, in particular ground-state density matrices and energies, and interatomic forces. These bounds are based on an estimation of the error in terms of the residual of the solved equations, which is then efficiently approximated with computable terms. After providing coarse bounds based on an analysis of the inverse Jacobian, we improve on these bounds by solving a linear problem in a small dimension that involves a Schur complement. We numerically show how accurate these bounds are on a few representative materials, namely silicon, gallium arsenide and titanium dioxide.

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$ arguments. We demonstrate how these symmetries can be exploited to improve the cost versus error ratio in a polynomial approximation of the function $f$, and in particular study the dependence of that ratio on $d, N$ and the polynomial degree. These results are then used to construct approximations and prove approximation rates for functions defined on multi-sets where $N$ becomes a parameter of the input.

Born-Oppenheimer Molecular Dynamics (BOMD) is a powerful but expensive technique. The main bottleneck in a density functional theory bomd calculation is the solution to the Kohn-Sham (KS) equations, that requires an iterative procedure that starts from a guess for the density matrix. Converged densities from previous points in the trajectory can be used to extrapolate a new guess, however, the non-linear constraint that an idempotent density needs to satisfy make the direct use of standard linear extrapolation techniques not possible. In this contribution, we introduce a locally bijective map between the manifold where the density is defined and its tangent space, so that linear extrapolation can be performed in a vector space while, at the same time, retaining the correct physical properties of the extrapolated density using molecular descriptors. We apply the method to real-life, multiscale polarizable QM/MM.

This paper deals with perturbation theory for discrete spectra of linear operators. To simplify exposition we consider here self-adjoint operators. This theory is based on the Feshbach-Schur map and it has advantages with respect to the standard perturbation theory in three aspects: (a) it readily produces rigorous estimates on eigenvalues and eigenfunctions with explicit constants; (b) it is compact and elementary (it uses properties of norms and the fundamental theorem of algebra about solutions of polynomial equations); and (c) it is based on a self-contained formulation of a fixed point problem for the eigenvalues and eigenfunctions, allowing for easy iterations. We apply our abstract results to obtain rigorous bounds on the ground states of Helium-type ions.

We propose an adaptive planewave method for eigenvalue problems in electronic structure calculations. The method combines a priori convergence rates and accurate a posteriori error estimates into an effective way of updating the energy cut-off for planewave discretizations, for both linear and nonlinear eigenvalue problems. The method is error controllable for linear eigenvalue problems in the sense that for a given required accuracy, an energy cut-off for which the solution matches the target accuracy can be reached efficiently. Further, the method is particularly promising for nonlinear eigenvalue problems in electronic structure calculations as it shall reduce the cost of early iterations in self-consistent algorithms. We present some numerical experiments for both linear and nonlinear eigenvalue problems. In particular, we provide electronic structure calculations for some insulator and metallic systems simulated with Kohn--Sham density functional theory (DFT) and the projector augmented wave (PAW) method, illustrating the efficiency and potential of the algorithm.

We introduce and explore an approach for constructing force fields for small molecules, which combines intuitive low body order empirical force field terms with the concepts of data driven statistical fits of recent machine learned potentials. We bring these two key ideas together to bridge the gap between established empirical force fields that have a high degree of transferability on the one hand, and the machine learned potentials that are systematically improvable and can converge to very high accuracy, on the other. Our framework extends the atomic Permutationally Invariant Polynomials (aPIP) developed for elemental materials in [Mach. Learn.: Sci. Technol. 2019 1 015004] to molecular systems. The body order decomposition allows us to keep the dimensionality of each term low, while the use of an iterative fitting scheme as well as regularisation procedures improve the extrapolation outside the training set. We investigate aPIP force fields with up to generalised 4-body terms, and examine the performance on a set of small organic molecules. We achieve a high level of accuracy when fitting individual molecules, comparable to those of the many-body machine learned force fields. Fitted to a combined training set of short linear alkanes, the accuracy of the aPIP force field still significantly exceeds what can be expected from classical empirical force fields, while retaining reasonable transferability to both configurations far from the training set and to new molecules.

In this article, we propose a new numerical method and its analysis to solve eigenvalue problems for self-adjoint Schr{\"o}dinger operators, by combining the Feshbach-Schur perturbation theory with the spectral Fourier discretization. In order to analyze the method, we establish an abstract framework of Feshbach-Schur perturbation theory with minimal regularity assumptions on the potential that is then applied to the setting of the new spectral Fourier discretization method. Finally, we present some numerical results that underline the theoretical findings.

This paper presents a posteriori error estimates for conforming numerical approximations of eigenvalue clusters of second-order self-adjoint elliptic linear operators with compact resolvent. Given a cluster of eigenvalues, we estimate the error in the sum of the eigenvalues, as well as the error in the eigenvectors represented through the density matrix, i.e., the orthogonal projector on the associated eigenspace. This allows us to deal with degenerate (multiple) eigenvalues within the framework. All the bounds are valid under the only assumption that the cluster is separated from the surrounding smaller and larger eigenvalues; we show how this assumption can be numerically checked. Our bounds are guaranteed and converge with the same speed as the exact errors. They can be turned into fully computable bounds as soon as an estimate on the dual norm of the residual is available, which is presented in two particular cases: the Laplace eigenvalue problem discretized with conforming finite elements, and a Schr{\"o}dinger operator with periodic boundary conditions of the form $--$\Delta$ + V$ discretized with planewaves. For these two cases, numerical illustrations are provided on a set of test problems.

Repeated computations on the same molecular system, but with different geometries, are often performed in quantum chemistry, for instance, in ab-initio molecular dynamics simulations or geometry optimizations. While many efficient strategies exist to provide a good guess for the self-consistent field procedure, which is usually the main computational task to be performed, little is known on how to efficiently exploit in this direction the abundance of information generated during the many computations. In this article, we present a strategy to provide an accurate initial guess for the density matrix, expanded in a set of localized basis functions, within the self-consistent field iterations for parametrized Hartree-Fock problems where the nuclear coordinates are changed along a few user-specified collective variables, such as the molecule's normal modes. Our approach is based on an offline-stage where the Hartree-Fock eigenvalue problem is solved for some particular parameter values and an online-stage where the initial guess is computed very efficiently for any new parameter value.The method allows non-linear approximations of density matrices, which belong to a non-linear manifold that is isomorphic to the Grassmann manifold.The so-called Grassmann exponential and logarithm map the manifold onto the tangent space and thus provides the correct geometrical setting accounting for the manifold structure when working with subspaces rather than functions itself.Numerical tests on different amino acids show promising initial results.

The Atomic Cluster Expansion (Drautz, Phys. Rev. B 99, 2019) provides a framework to systematically derive polynomial basis functions for approximating isometry and permutation invariant functions, particularly with an eye to modelling properties of atomistic systems. Our presentation extends the derivation by proposing a precomputation algorithm that yields immediate guarantees that a complete basis is obtained. We provide a fast recursive algorithm for efficient evaluation and illustrate its performance in numerical tests. Finally, we discuss generalisations and open challenges, particularly from a numerical stability perspective, around basis optimisation and parameter estimation, paving the way towards a comprehensive analysis of the convergence to a high-fidelity reference model., Comment: Title has changed in v3

We investigate the use of invariant polynomials in the construction of data-driven interatomic potentials for material systems. The "atomic body-ordered permutation-invariant polynomials" (aPIPs) comprise a systematic basis and are constructed to preserve the symmetry of the potential energy function with respect to rotations and permutations. In contrast to kernel based and artificial neural network models, the explicit decomposition of the total energy as a sum of atomic body-ordered terms allows to keep the dimensionality of the fit reasonably low, up to just 10 for the 5-body terms. The explainability of the potential is aided by this decomposition, as the low body-order components can be studied and interpreted independently. Moreover, although polynomial basis functions are thought to extrapolate poorly, we show that the low dimensionality combined with careful regularisation actually leads to better transferability than the high dimensional, kernel based Gaussian Approximation Potential.

It is often claimed that error cancellation plays an essential role in quantum chemistry and first-principle simulation for condensed matter physics and materials science. Indeed, while the energy of a large, or even medium-size, molecular system cannot be estimated numerically within chemical accuracy (typically 1 kcal/mol or 1 mHa), it is considered that the energy difference between two configurations of the same system can be computed in practice within the desired accuracy. The purpose of this paper is to provide a quantitative study of discretization error cancellation. The latter is the error component due to the fact that the model used in the calculation (e.g. Kohn-Sham LDA) must be discretized in a finite basis set to be solved by a computer. We first report comprehensive numerical simulations performed with Abinit on two simple chemical systems, the hydrogen molecule on the one hand, and a system consisting of two oxygen atoms and four hydrogen atoms on the other hand. We observe that errors on energy differences are indeed significantly smaller than errors on energies, but that these two quantities asymptotically converge at the same rate when the energy cut-off goes to infinity. We then analyze a simple one-dimensional periodic Schr\"odinger equation with Dirac potentials, for which analytic solutions are available. This allows us to explain the discretization error cancellation phenomenon on this test case with quantitative mathematical arguments.