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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
