SearcharxivSearch

arXiv subjects

A. Mikhalev

Publications and source records attributed to A. Mikhalev.

2 recordsLinked to original sources

An approximation strategy to compute accurate initial density matrices for repeated self-consistent field calculations at different geometries

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.

physics.chem-ph

Rectangular maximum-volume submatrices and their applications

We introduce a definition of the volume for a general rectangular matrix, which for square matrices is equivalent to the absolute value of the determinant. We generalize results for square maximum-volume submatrices to the case of rectangular maximal-volume submatrices, show connection of the rectangular volume with optimal experimental design and provide estimates for the growth of the coefficients and approximation error in spectral and Chebyshev norms. Three promising applications of such submatrices are presented: recommender systems, finding maximal elements in low-rank matrices and preconditioning of overdetermined linear systems. The code is available online.

math.NA