Search

Classical dynamics can be described with Newton's equation of motion or, totally equivalently, using the Hamilton-Jacobi equation. Here, the possibility of using the Hamilton-Jacobi equation to describe chemical reaction dynamics is explored. This requires an efficient computational approach for constructing the physically and chemically relevant solutions to the Hamilton-Jacobi equation; here we solve Hamilton-Jacobi equations on a Cartesian grid using Sethian's fast marching method. Using this method, we can--starting from an arbitrary initial conformation--find reaction paths that minimize the action or the time. The method is demonstrated by computing the mechanism for two different systems: a model system with four different stationary configurations and the H+H(2)-->H(2)+H reaction. Least-time paths (termed brachistochrones in classical mechanics) seem to be a suitable chioce for the reaction coordinate, allowing one to determine the key intermediates and final product of a chemical reaction. For conservative systems the Hamilton-Jacobi equation does not depend on the time, so this approach may be useful for simulating systems where important motions occur on a variety of different time scales.

A new numerical integration procedure for exchange-correlation energies and potentials is proposed and “proof of principle” results are presented. The numerical integration grids are built from sparse-tensor product grids (constructed according to Smolyak’s prescription [Dokl. Akad. Nauk. 4, 240 (1963)] ) on the unit cube. The grid on the unit cube is then transformed to a grid over real space with respect to a weight function, which we choose to be the promolecular density. This produces a “whole molecule” grid, in contrast to conventional integration methods in density-functional theory, which use atom-in-molecule grids. The integration scheme was implemented in a modified version of the DEMON2K density-functional theory program, where it is used to evaluate integrals of the exchange-correlation energy density and the exchange-correlation potential. Ground-state energies and molecular geometries are accurately computed. The biggest advantages of the grid are its flexibility (it is easy to change the number and distribution of grid points) and its whole molecule nature. The latter feature is potentially helpful for basis-set-free computational algorithms. [ABSTRACT FROM AUTHOR]

We provide a rigorous proof that the Hohenberg-Kohn theorem holds for spin densities by extending Lieb’s Legendre-transform formulation to spin densities. The resulting spin-density-functional theory resolves several troublesome issues. Most importantly, the present paper provides an explicit construction for the spin potentials at any point along the adiabatic connection curve, thus providing a formal basis for the use of exchange-correlation functionals of the spin density in the Kohn-Sham density-functional theory (DFT). The practical implications of this result for unrestricted Kohn-Sham DFT calculations is considered, and the existence of holes below the Fermi level is discussed. We argue that an orbital’s energy tends to increase as its occupation number increases, which provides the basis for a computational algorithm for determining the occupation numbers in Kohn-Sham DFT and helps explain the origin of Hund’s rules and holes below the Fermi level. [ABSTRACT FROM AUTHOR]

In methods like geminal-based approaches or coupled cluster that are solved using the projected Schrödinger equation, direct computation of the 2-electron reduced density matrix (2-RDM) is impractical and one falls back to a 2-RDM based on response theory. However, the 2-RDMs from response theory are not N-representable. That is, the response 2-RDM does not correspond to an actual physical N-electron wave function. We present a new algorithm for making these non-N-representable 2-RDMs approximately N-representable, i.e., it has the right symmetry and normalization and it fulfills the P-, Q-, and G-conditions. Next to an algorithm which can be applied to any 2-RDM, we have also developed a 2-RDM optimization procedure specifically for seniority-zero 2-RDMs. We aim to find the 2-RDM with the right properties which is the closest (in the sense of the Frobenius norm) to the non-N-representable 2-RDM by minimizing the square norm of the difference between this initial response 2-RDM and the targeted 2-RDM under the constraint that the trace is normalized and the 2-RDM, Q-matrix, and G-matrix are positive semidefinite, i.e., their eigenvalues are non-negative. Our method is suitable for fixing non-N-representable 2-RDMs which are close to being N-representable. Through the N-representability optimization algorithm we add a small correction to the initial 2-RDM such that it fulfills the most important N-representability conditions. [ABSTRACT FROM AUTHOR]