Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFast and stable determinant quantum Monte Carlo
68
0
0.0
(
0
)
Authors
Carsten Bauer
Ask ChatGPT about the research
No Arabic abstract
We assess numerical stabilization methods employed in fermion many-body quantum Monte Carlo simulations. In particular, we empirically compare various matrix decomposition and inversion schemes to gain control over numerical instabilities arising in the computation of equal-time and time-displaced Greens functions within the determinant quantum Monte Carlo (DQMC) framework. Based on this comparison, we identify a procedure based on pivoted QR decompositions which is both efficient and accurate to machine precision. The Julia programming language is used for the assessment and implementations of all discussed algorithms are provided in the open-source software library StableDQMC.jl [http://github.com/crstnbr/StableDQMC.jl].
rate research
Read More
Within ab initio Quantum Monte Carlo simulations, the leading numerical cost for large systems is the computation of the values of the Slater determinants in the trial wavefunction. Each Monte Carlo step requires finding the determinant of a dense matrix. This is most commonly iteratively evaluated using a rank-1 Sherman-Morrison updating scheme to avoid repeated explicit calculation of the inverse. The overall computational cost is therefore formally cubic in the number of electrons or matrix size. To improve the numerical efficiency of this procedure, we propose a novel multiple rank delayed update scheme. This strategy enables probability evaluation with application of accepted moves to the matrices delayed until after a predetermined number of moves, K. The accepted events are then applied to the matrices en bloc with enhanced arithmetic intensity and computational efficiency via matrix-matrix operations instead of matrix-vector operations. This procedure does not change the underlying Monte Carlo sampling or its statistical efficiency. For calculations on large systems and algorithms such as diffusion Monte Carlo where the acceptance ratio is high, order of magnitude improvements in the update time can be obtained on both multi-core CPUs and GPUs.
Quantum Monte Carlo (QMC) methods are some of the most accurate methods for simulating correlated electronic systems. We investigate the compatibility, strengths and weaknesses of two such methods, namely, diffusion Monte Carlo (DMC) and auxiliary-field quantum Monte Carlo (AFQMC). The multi-determinant trial wave functions employed in both approaches are generated using the configuration interaction using a perturbative selection made iteratively (CIPSI) technique. Complete basis set full configuration interaction (CBS-FCI) energies estimated with CIPSI are used as a reference in this comparative study between DMC and AFQMC. By focusing on a set of canonical finite size solid state systems, we show that both QMC methods can be made to systematically converge towards the same energy once basis set effects and systematic biases have been removed. AFQMC shows a much smaller dependence on the trial wavefunction than DMC while simultaneously exhibiting a much larger basis set dependence. We outline some of the remaining challenges and opportunities for improving these approaches.
An inhomogeneous backflow transformation for many-particle wave functions is presented and applied to electrons in atoms, molecules, and solids. We report variational and diffusion quantum Monte Carlo VMC and DMC energies for various systems and study the computational cost of using backflow wave functions. We find that inhomogeneous backflow transformations can provide a substantial increase in the amount of correlation energy retrieved within VMC and DMC calculations. The backflow transformations significantly improve the wave functions and their nodal surfaces.
Random batch algorithms are constructed for quantum Monte Carlo simulations. The main objective is to alleviate the computational cost associated with the calculations of two-body interactions, including the pairwise interactions in the potential energy, and the two-body terms in the Jastrow factor. In the framework of variational Monte Carlo methods, the random batch algorithm is constructed based on the over-damped Langevin dynamics, so that updating the position of each particle in an $N$-particle system only requires $mathcal{O}(1)$ operations, thus for each time step the computational cost for $N$ particles is reduced from $mathcal{O}(N^2)$ to $mathcal{O}(N)$. For diffusion Monte Carlo methods, the random batch algorithm uses an energy decomposition to avoid the computation of the total energy in the branching step. The effectiveness of the random batch method is demonstrated using a system of liquid ${}^4$He atoms interacting with a graphite surface.
We present an overview of the variational and diffusion quantum Monte Carlo methods as implemented in the CASINO program. We particularly focus on developments made in the last decade, describing state-of-the-art quantum Monte Carlo algorithms and software and discussing their strengths and their weaknesses. We review a range of recent applications of CASINO.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
