IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v474y2024ics0096300324001553.html
   My bibliography  Save this article

Computational efficiency study of a micro-macro Markov chain Monte Carlo method for molecular dynamics

Author

Listed:
  • Vandecasteele, Hannes
  • Samaey, Giovanni

Abstract

We study the numerical properties of a recently introduced micro-macro Markov chain Monte Carlo (mM-MCMC) scheme that accelerates sampling of Gibbs distributions when there is a time-scale separation between the complete (microscopic) molecular dynamics and the slow dynamics of a low dimensional reaction coordinate. The micro-macro Markov chain works in three steps: 1) compute the reaction coordinate value associated to the current molecular state; 2) generate a new macroscopic proposal using a proposal distribution; 3) reconstruct a molecular configuration that is consistent with the newly sampled macroscopic value. Here, we systematically study the impact of method parameters on the efficiency of the micro-macro Markov chain Monte Carlo method, namely the chosen macroscopic dynamics and the microscopic reconstruction distribution. We specifically investigate the impact of the macroscopic and reconstruction proposal distributions and their parameters on this efficiency on two prototypical molecular systems, a three-atom molecule and butane. We find, through detailed computational experiments, that the efficiency is largest when these proposal distributions are close to their time-invariant counterparts and that it is robust with respect to parameter changes.

Suggested Citation

  • Vandecasteele, Hannes & Samaey, Giovanni, 2024. "Computational efficiency study of a micro-macro Markov chain Monte Carlo method for molecular dynamics," Applied Mathematics and Computation, Elsevier, vol. 474(C).
  • Handle: RePEc:eee:apmaco:v:474:y:2024:i:c:s0096300324001553
    DOI: 10.1016/j.amc.2024.128683
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324001553
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2024.128683?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:474:y:2024:i:c:s0096300324001553. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.