Library

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    College Park, Md. : American Institute of Physics (AIP)
    The Journal of Chemical Physics 114 (2001), S. 8752-8762 
    ISSN: 1089-7690
    Source: AIP Digital Archive
    Topics: Physics , Chemistry and Pharmacology
    Notes: We present a method for accelerating convergence of Monte Carlo simulations of associating fluids. Such fluids exhibit strong, short-ranged, orientation-specific intermolecular attractions which are difficult to sample via conventional molecular simulation. We propose a bias scheme that preferentially attempts Monte Carlo trials that lead to "unbonding" or "bonding" (UB) transitions of the associating molecules. The proposed method is most like the recently introduced aggregation volume bias Monte Carlo (AVBMC) algorithm of Chen and Siepmann. Both algorithms are much simpler, more efficient, and more generally applicable than previously proposed association-bias schemes. We study the UB algorithm via application to the simple ideal-association model of van Roij. Although unrealistic, the model contains the basic features of association that cause problems for simulation, and its simple nature facilitates analysis of the performance of the simulation algorithm. We find, at least in application to this model, that the UB algorithm exhibits better convergence properties when compared to AVBMC, and through analysis of the acceptance probability distributions we can develop an explanation for this difference. We also demonstrate the UB algorithm in the context of the Gibbs ensemble, reproducing the phase coexistence behavior of a dimerization model originally proposed by Tsangaris and de Pablo. © 2001 American Institute of Physics.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...