𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improving the Wang–Landau algorithm for polymers and proteins

✍ Scribed by Adam D. Swetnam; Michael P. Allen

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
394 KB
Volume
32
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The 1/t Wang–Landau algorithm is tested on simple models of polymers and proteins. It is found that this method resolves the problem of the saturation of the error present in the original algorithm for lattice polymers. However, for lattice proteins, which have a rough energy landscape with an unknown energy minimum, it is found that the density of states does not converge in all runs. A new variant of the Wang–Landau algorithm that appears to solve this problem is described and tested. In the new variant, the optimum modification factor is calculated in the same straightforward way throughout the simulation. There is only one free parameter for which a value of unity appears to give near optimal convergence for all run lengths for lattice homopolymers when pull moves are used. For lattice proteins, a much smaller value of the parameter is needed to ensure rapid convergence of the density of states for energies discovered late in the simulation, which unfortunately results in poor convergence early on in the run. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2011.

📜 SIMILAR VOLUMES

Efficient combination of Wang–Landau and
Efficient combination of Wang–Landau and transition matrix Monte Carlo methods for protein simulations
✍ Ruben G. Ghulghazaryan; Shura Hayryan; Chin-Kun Hu 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 493 KB

## Abstract An efficient combination of the Wang‐Landau and transition matrix Monte Carlo methods for protein and peptide simulations is described. At the initial stage of simulation the algorithm behaves like the Wang‐Landau algorithm, allowing to sample the entire interval of energies, and at the

Fast Algorithms for Numerical, Conservat
Fast Algorithms for Numerical, Conservative, and Entropy Approximations of the Fokker–Planck–Landau Equation
✍ C. Buet; S. Cordier; P. Degond; M. Lemou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 482 KB

We present fast numerical algorithms to solve the nonlinear Fokker-Planck-Landau equation in 3D velocity space. The discretization of the collision operator preserves the properties required by the physical nature of the Fokker-Planck-Landau equation, such as the conservation of mass, momentum, an

An algorithm for predicting the properti
An algorithm for predicting the properties of products incorporating recycled polymers
✍ C. A. Bernardo; A. M. Cunha; M. J. Oliveira 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 430 KB 👁 1 views

An algorithm that can be used to predict a great variety of important properties of mixtures of virgin and recycled polymers is developed in the present work. This algorithm revises a derivation previously published in the literature and generalizes it to take into account properties that cannot be

New longest-edge algorithms for the refi
New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
✍ María-Cecilia Rivara 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB 👁 1 views

In this paper I introduce a new mathematical tool for dealing with the refinement and/or the improvement of unstructured triangulations: the Longest-Edge Propagation Path associated with each triangle to be either refined and/or improved in the mesh. This is defined as the (finite) ordered list of s