dc.contributor | Virginia Tech | en |
dc.contributor.author | Ahuja, K. | en |
dc.contributor.author | Clark, B. K. | en |
dc.contributor.author | De Sturler, E. | en |
dc.contributor.author | Ceperley, D. M. | en |
dc.contributor.author | Kim, J. | en |
dc.date.accessioned | 2014-05-28T18:35:07Z | en |
dc.date.available | 2014-05-28T18:35:07Z | en |
dc.date.issued | 2011 | en |
dc.identifier.citation | Ahuja, K.; Clark, B. K.; De Sturler, E.; Ceperley, D. M.; Kim, J., "Improved scaling for quantum monte carlo on insulators," SIAM J. Sci. Comput., 33(4), 1837-1859, (2011). DOI: 10.1137/100805467 | en |
dc.identifier.issn | 1064-8275 | en |
dc.identifier.uri | http://hdl.handle.net/10919/48153 | en |
dc.description.abstract | Quantum Monte Carlo (QMC) methods are often used to calculate properties of many body quantum systems. The main cost of many QMC methods, for example, the variational Monte Carlo (VMC) method, is in constructing a sequence of Slater matrices and computing the ratios of determinants for successive Slater matrices. Recent work has improved the scaling of constructing Slater matrices for insulators so that the cost of constructing Slater matrices in these systems is now linear in the number of particles, whereas computing determinant ratios remains cubic in the number of particles. With the long term aim of simulating much larger systems, we improve the scaling of computing the determinant ratios in the VMC method for simulating insulators by using preconditioned iterative solvers. The main contribution of this paper is the development of a method to efficiently compute for the Slater matrices a sequence of preconditioners that make the iterative solver converge rapidly. This involves cheap preconditioner updates, an effective reordering strategy, and a cheap method to monitor instability of incomplete LU decomposition with threshold and pivoting (ILUTP) preconditioners. Using the resulting preconditioned iterative solvers to compute determinant ratios of consecutive Slater matrices reduces the scaling of QMC algorithms from O(n(3)) per sweep to roughly O(n(2)), where n is the number of particles, and a sweep is a sequence of n steps, each attempting to move a distinct particle. We demonstrate experimentally that we can achieve the improved scaling without increasing statistical errors. Our results show that preconditioned iterative solvers can dramatically reduce the cost of VMC for large(r) systems. | en |
dc.description.sponsorship | NSF NSF-EAR 0530643 | en |
dc.description.sponsorship | Materials Computation Center at the University of Illinois | en |
dc.language.iso | en_US | en |
dc.publisher | Siam Publications | en |
dc.rights | In Copyright | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
dc.subject | variational monte carlo | en |
dc.subject | quantum monte carlo | en |
dc.subject | sequence of linear | en |
dc.subject | systems | en |
dc.subject | preconditioning | en |
dc.subject | updating preconditioners | en |
dc.subject | krylov subspace | en |
dc.subject | methods | en |
dc.subject | permuting large entries | en |
dc.subject | linear-systems | en |
dc.subject | preconditioners | en |
dc.subject | simulations | en |
dc.subject | algorithms | en |
dc.subject | matrices | en |
dc.subject | mathematics, applied | en |
dc.title | Improved scaling for quantum monte carlo on insulators | en |
dc.type | Article - Refereed | en |
dc.contributor.department | Mathematics | en |
dc.identifier.url | http://epubs.siam.org/doi/abs/10.1137/100805467 | en |
dc.date.accessed | 2014-05-27 | en |
dc.title.serial | Siam Journal on Scientific Computing | en |
dc.identifier.doi | https://doi.org/10.1137/100805467 | en |