Virginia Tech
    • Log in
    View Item 
    •   VTechWorks Home
    • College of Science (COS)
    • Department of Mathematics
    • Scholarly Works, Department of Mathematics
    • View Item
    •   VTechWorks Home
    • College of Science (COS)
    • Department of Mathematics
    • Scholarly Works, Department of Mathematics
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Improved scaling for quantum monte carlo on insulators

    Thumbnail
    View/Open
    Main article (1.770Mb)
    Downloads: 224
    Date
    2011
    Author
    Ahuja, Kapil
    Clark, Bryan K.
    de Sturler, Eric
    Ceperley, David M.
    Kim, Jeongnim
    Metadata
    Show full item record
    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(n3) per sweep to roughly O(n2), 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.
    URI
    http://hdl.handle.net/10919/48153
    Collections
    • Scholarly Works, Department of Mathematics [289]

    If you believe that any material in VTechWorks should be removed, please see our policy and procedure for Requesting that Material be Amended or Removed. All takedown requests will be promptly acknowledged and investigated.

    Virginia Tech | University Libraries | Contact Us
     

     

    VTechWorks

    AboutPoliciesHelp

    Browse

    All of VTechWorksCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Log inRegister

    Statistics

    View Usage Statistics

    If you believe that any material in VTechWorks should be removed, please see our policy and procedure for Requesting that Material be Amended or Removed. All takedown requests will be promptly acknowledged and investigated.

    Virginia Tech | University Libraries | Contact Us